Symmetry in Boolean Satisfiability
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2010-06-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/2/2/1121/ |
| id |
doaj-7ef157b53f9a4c8f96ab6976ee7bf200 |
|---|---|
| record_format |
Article |
| spelling |
doaj-7ef157b53f9a4c8f96ab6976ee7bf2002020-11-24T23:46:36ZengMDPI AGSymmetry2073-89942010-06-01221121113410.3390/sym2021121Symmetry in Boolean SatisfiabilityFadi A. AloulThis 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. http://www.mdpi.com/2073-8994/2/2/1121/boolean satisfiabilitysymmetriessearch |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Fadi A. Aloul |
| spellingShingle |
Fadi A. Aloul Symmetry in Boolean Satisfiability Symmetry boolean satisfiability symmetries search |
| author_facet |
Fadi A. Aloul |
| author_sort |
Fadi A. Aloul |
| title |
Symmetry in Boolean Satisfiability |
| title_short |
Symmetry in Boolean Satisfiability |
| title_full |
Symmetry in Boolean Satisfiability |
| title_fullStr |
Symmetry in Boolean Satisfiability |
| title_full_unstemmed |
Symmetry in Boolean Satisfiability |
| title_sort |
symmetry in boolean satisfiability |
| publisher |
MDPI AG |
| series |
Symmetry |
| issn |
2073-8994 |
| publishDate |
2010-06-01 |
| description |
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. |
| topic |
boolean satisfiability symmetries search |
| url |
http://www.mdpi.com/2073-8994/2/2/1121/ |
| work_keys_str_mv |
AT fadiaaloul symmetryinbooleansatisfiability |
| _version_ |
1725493221158551552 |