Dynamic symmetry-breaking for Boolean satisfiability

DOI10.1007/S10472-010-9173-2MaRDI QIDQ976993zbMATH OpenOpenAlexFDO

Authors Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah

Publication date 16 June 2010

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-010-9173-2

zbMATH Keywords

optimizationsearchformal verificationBoolean satisfiabilitydynamic symmetry breaking

Mathematics Subject Classification ID

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

Recommendations

• Search techniques for SAT-based Boolean optimization
• Symmetric explanation learning: effective dynamic symmetry handling for SAT
• Symmetry Breaking for Maximum Satisfiability
• Improving Unsatisfiability-Based Algorithms for Boolean Optimization
• Symmetry breaking for pseudo-Boolean formulas

Cites work

• BerkMin: A fast and robust SAT-solver
• Conditional Symmetry Breaking
• Symmetry breaking for pseudo-Boolean formulas

Cited in

(10)

• The state of SAT
• Theory and Applications of Satisfiability Testing
• CDCLSym: introducing effective symmetry breaking in SAT solving
• Generating effective symmetry-breaking predicates for search problems
• Symmetry Breaking for Maximum Satisfiability
• Efficient symmetry breaking for SAT-based minimum DFA inference
• Packing, partitioning, and covering symresacks
• Search techniques for SAT-based Boolean optimization
• Dynamic structural symmetry breaking for constraint satisfaction problems
• A study of symmetry breaking predicates and model counting

Describes a project that uses

Uses Software

• PBS
• Chaff
• BerkMin
• Velev SAT Benchmarks
• Shatter

This page was built for publication: Dynamic symmetry-breaking for Boolean satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976993)