Symmetry 2010, 2(2), 1121-1134; doi:10.3390/sym2021121

Symmetry in Boolean Satisfiability

Received: 31 December 2009; in revised form: 14 May 2010 / Accepted: 9 June 2010 / Published: 11 June 2010
(This article belongs to the Special Issue Feature Papers: Symmetry Concepts and Applications)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: 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.
Keywords: boolean satisfiability; symmetries; search
PDF Full-text Download PDF Full-Text [182 KB, Updated Version, uploaded 14 June 2010 13:18 CEST]
The original version is still available [163 KB, uploaded 11 June 2010 13:49 CEST]

Export to BibTeX |

MDPI and ACS Style

Aloul, F.A. Symmetry in Boolean Satisfiability. Symmetry 2010, 2, 1121-1134.

AMA Style

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.

Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert