- freely available
Symmetry in Boolean Satisfiability
AbstractThis paper reviews recent approaches on how to accelerate Boolean Satisfiability (SAT) search by exploiting symmetries in the problem space. SAT search algorithms traverse an exponentially large search space looking for an assignment that satisfies a set of constraints. The presence of symmetries in the search space induces equivalence classes on the set of truth assignments. The goal is to use symmetries to avoid traversing all assignments by constraining the search to visit a few representative assignments in each equivalence class. This can lead to a significant reduction in search runtime without affecting the completeness of the search.
Share & Cite This Article
Export to BibTeX | EndNote
MDPI and ACS Style
Aloul, F.A. Symmetry in Boolean Satisfiability. Symmetry 2010, 2, 1121-1134.View more citation formats
Aloul FA. Symmetry in Boolean Satisfiability. Symmetry. 2010; 2(2):1121-1134.Chicago/Turabian Style
Aloul, Fadi A. 2010. "Symmetry in Boolean Satisfiability." Symmetry 2, no. 2: 1121-1134.