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
Article Menu

Article Versions

Export Article

Open AccessReview
Symmetry 2010, 2(2), 1121-1134;

Symmetry in Boolean Satisfiability

American University of Sharjah, P.O. Box 26666, Sharjah, United Arab Emirates
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)
PDF [182 KB, uploaded 14 June 2010]   |  


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 boolean satisfiability; symmetries; search

Graphical abstract

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

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

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top