A Compressed Breadth-First Search for Satisfiability

Leading algorithms for Boolean satisfiability (SAT) are based on either a depth-first tree traversal of the search space (the DLL procedure [6]) or resolution (the DP procedure [7]). In thiswork we introduce a variant of Breadth-First Search (BFS) based on the ability of Zero-Suppressed Binary Decision Diagrams (ZDDs) to compactly represent sparse or structured collections of subsets. While a BFS may require an exponential amount of memory, our new algorithm performs BFS directly with an implicit representation and achieves unconventional reductions in the search space.We empirically evaluate our implementation on classical SAT instances difficult for DLL/DP solvers. Our main result is the empirical ?(n4) runtime for holen instances, on which DLL solvers require exponential time.

[1]  Giovanni Manzini,et al.  An experimental study of an opportunistic index , 2001, SODA '01.

[2]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[3]  Hans Zantema,et al.  Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially , 2001, Ershov Memorial Conference.

[4]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[5]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[6]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[7]  Ralph Udo Gasser,et al.  Harnessing computational resources for efficient exhaustive search , 1995 .

[8]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[9]  K. Sakallah,et al.  Backtrack Search Using ZBDDs , 2001 .

[10]  Giovanni Manzini,et al.  An experimental study of a compressed index , 2001, Inf. Sci..

[11]  Michael E. Saks,et al.  The Efficiency of Resolution and Davis--Putnam Procedures , 2002, SIAM J. Comput..

[12]  Igor L. Markov,et al.  Faster SAT and smaller BDDs via common function structure , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[13]  Moshe Y. Vardi,et al.  Random 3-SAT and BDDs: The Plot Thickens Further , 2001, CP.

[14]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

[15]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[16]  Tomás E. Uribe,et al.  Ordered Binary Decision Diagrams and the Davis-Putnam Procedure , 1994, CCL.

[17]  Philippe Chatalic,et al.  Multi-resolution on compressed sets of clauses , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.