Improved static symmetry breaking for SAT
DOI10.1007/978-3-319-40970-2_8zbMATH Open1475.68340OpenAlexW2499282942MaRDI QIDQ2818005FDOQ2818005
Marc Denecker, Jo Devriendt, Maurice Bruynooghe, Bart Bogaerts
Publication date: 5 September 2016
Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/542704
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Theory and Applications of Satisfiability Testing
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- Practical graph isomorphism. II.
- Title not available (Why is that?)
- Hard examples for resolution
- The intractability of resolution
- Generating effective symmetry-breaking predicates for search problems
- Symmetry and Satisfiability: An Update
- Dynamic Symmetry Breaking by Simulating Zykov Contraction
Cited In (18)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers
- Formula simplification via invariance detection by algebraically indexed types
- Efficient symmetry breaking for SAT-based minimum DFA inference
- Preprocessing of propagation redundant clauses
- Preprocessing of propagation redundant clauses
- The complexity of symmetry-breaking formulas
- SAT modulo symmetries for graph generation and enumeration
- Symmetry Breaking for Maximum Satisfiability
- Title not available (Why is that?)
- A Study of Symmetry Breaking Predicates and Model Counting
- Automated mathematical discovery and verification: minimizing pentagons in the plane
- Strong extension-free proof systems
- An adaptive prefix-assignment technique for symmetry reduction
- Reducing symmetries to generate easier SAT instances
- How constraint programming can help chemists to generate benzenoid structures and assess the local aromaticity of benzenoids
- Certified dominance and symmetry breaking for combinatorial optimisation
- CDCLSym: introducing effective symmetry breaking in SAT solving
- SAT competition 2020
Uses Software
This page was built for publication: Improved static symmetry breaking for SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2818005)
