Symmetry Breaking for Maximum Satisfiability
From MaRDI portal
Publication:5505539
DOI10.1007/978-3-540-89439-1_1zbMATH Open1182.68257OpenAlexW1801196578MaRDI QIDQ5505539FDOQ5505539
Authors: Inês Lynce, Joao Marques-Silva, Vasco Manquinho
Publication date: 27 January 2009
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/266608/1/jpms-lpar08.pdf
Recommendations
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- Dynamic symmetry-breaking for Boolean satisfiability
- Symmetry-breaking answer set solving
- Optimal symmetry breaking for graph problems
- Improved static symmetry breaking for SAT
- Symmetry and Satisfiability: An Update
- Exploiting symmetry in SMT problems
- Dynamic structural symmetry breaking for constraint satisfaction problems
- Symmetry definitions for constraint satisfaction problems
- Symmetry Definitions for Constraint Satisfaction Problems
Cited In (18)
- Symmetry breaking for pseudo-Boolean formulas
- BFS-based symmetry breaking predicates for DFA identification
- Dynamic symmetry-breaking for Boolean satisfiability
- Dynamic structural symmetry breaking for constraint satisfaction problems
- Optimal symmetry breaking for graph problems
- Expressing symmetry breaking in DRAT proofs
- Improved static symmetry breaking for SAT
- Efficient symmetry breaking for SAT-based minimum DFA inference
- Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
- Symmetry and Satisfiability: An Update
- Speeding up SAT solver by exploring CNF symmetries: Revisited
- Constraint-based electoral districting using a new compactness measure: an application to Portugal
- Title not available (Why is that?)
- Reducing symmetries to generate easier SAT instances
- Certified dominance and symmetry breaking for combinatorial optimisation
- CDCLSym: introducing effective symmetry breaking in SAT solving
- Local Symmetry Breaking During Search in CSPs
- A study of symmetry breaking predicates and model counting
This page was built for publication: Symmetry Breaking for Maximum Satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505539)