Symmetry Breaking for Maximum Satisfiability

DOI10.1007/978-3-540-89439-1_1MaRDI QIDQ5505539zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

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)

• A study of symmetry breaking predicates and model counting
• 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
• Improved static symmetry breaking for SAT
• Expressing symmetry breaking in DRAT proofs
• 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
• scientific article; zbMATH DE number 2084764 (Why is no real title available?)
• Reducing symmetries to generate easier SAT instances
• CDCLSym: introducing effective symmetry breaking in SAT solving
• Certified dominance and symmetry breaking for combinatorial optimisation
• Local Symmetry Breaking During Search in CSPs

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)