%0 Journal Article
%T Symmetry in Boolean Satisfiability
%A Fadi A. Aloul
%J Symmetry
%D 2010
%I MDPI AG
%R 10.3390/sym2021121
%X This 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.
%K boolean satisfiability
%K symmetries
%K search
%U http://www.mdpi.com/2073-8994/2/2/1121