Dynamic symmetry-breaking for Boolean satisfiability

DOI10.1007/S10472-010-9173-2zbMATH Open1205.68366OpenAlexW2137289237MaRDI QIDQ976993FDOQ976993

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

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

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)

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
• Dynamic structural symmetry breaking for constraint satisfaction problems
• Theory and Applications of Satisfiability Testing
• Efficient symmetry breaking for SAT-based minimum DFA inference
• Symmetry Breaking for Maximum Satisfiability
• Generating effective symmetry-breaking predicates for search problems
• A Study of Symmetry Breaking Predicates and Model Counting
• Search techniques for SAT-based Boolean optimization
• Packing, partitioning, and covering symresacks
• CDCLSym: introducing effective symmetry breaking in SAT solving

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)