Dynamic symmetry-breaking for Boolean satisfiability

DOI10.1007/s10472-010-9173-2zbMath1205.68366OpenAlexW2137289237MaRDI QIDQ976993

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

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

optimizationformal verificationsearchBoolean satisfiabilitydynamic symmetry breaking

Mathematics Subject Classification ID

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

Related Items (5)

A Study of Symmetry Breaking Predicates and Model Counting ⋮ The state of SAT ⋮ Generating effective symmetry-breaking predicates for search problems ⋮ Packing, partitioning, and covering symresacks ⋮ Search techniques for SAT-based Boolean optimization

Uses Software

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

Cites Work

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

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