Symmetry in Boolean Satisfiability 英文参考文献.docVIP

Symmetry 2010, 2, 1121-1134; doi:10.3390/sym2021121 OPEN ACCESS symmetry ISSN 2073-8994 /journal/symmetry Review Symmetry in Boolean Satisfiability Fadi A. Aloul American University of Sharjah, P.O. Box 26666, Sharjah, United Arab Emirates; E-Mail: faloul@ Received: 31 December 2009; in revised form: 14 May 2010 / Accepted: 9 June 2010 / Published: 11 June 2010 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 1. Introduction The last few years have seen a remarkable growth in the use of Boolean Satisfiability (SAT) models and algorithms for solving various problems in Engineering and Computer Science. This is mainly due to the fact that SAT algorithms have seen tremendous improvements in the last few years, allowing larger problem instances to be solved in different application domains. Such applications include formal verification [1], FPGA routing [2], power estimation [3], fault tolerance [4], network assignments [5], wireless communications [6], and scheduling [7]. SAT has also been extended to a variety of applications in Artificial Intelligence, including other well-known NP-complete problems. SAT solvers have traditionally been used to solve decision problems. Given a