Next Article in Journal
A Review of New Analytic Techniques for Quantifying Symmetry in Locomotion
Next Article in Special Issue
Symmetry and Asymmetry in Bouncing Gaits
Previous Article in Journal / Special Issue
Minimum Phi-Divergence Estimators and Phi-Divergence Test Statistics in Contingency Tables with Symmetry Structure: An Overview
Open AccessReview

Symmetry in Boolean Satisfiability

American University of Sharjah, P.O. Box 26666, Sharjah, United Arab Emirates
Symmetry 2010, 2(2), 1121-1134;
Received: 31 December 2009 / Revised: 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 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. View Full-Text
Keywords: boolean satisfiability; symmetries; search boolean satisfiability; symmetries; search
Show Figures

Graphical abstract

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.

Find Other Styles

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Search more from Scilit
Back to TopTop