Abstract

This paper introduces GRASP (Generic seaRch Algorithm for the Satisjiability Problem), an integrated algorithmic framework for SAT that un.$es several previously proposed searchpruning techniques and facilitates ident$cation of additional ones. GRASP is premised on the inevitability of confzicts during search and its most distinguishing feature is the augmentation of basic backtracking search with a powerfil confzict analysis procedure. Analyzing confzicts to determine their cawes enables GRASP to backtrack non-chronologically to earlier levels in the search tree, potentially pruning large portions of the search space. In addition, by “recording ” the causes of conflicts, GRASP can recognize andpreempt the occurrence of similar conficts later on in the search. Finally, straightjwward bookkeeping of the causality chains leading up to conflicts allows GRASP to identifi assignments that are necessary for a solution to be found. fiperimental results obtained from a large number of benchmarks, including many from the $eld of test pattern generation, indicate that application of the proposed confzict analysis techniques to SATalgorithm can be extremely effectivefor a large number of representative classes of SAT instances. 1

Citations

926	A computing procedure for quantification theory - Davis, Putnam - 1960
217	Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis - Stallman, Sussman - 1977
92	Nogood recording for static and dynamic constraint satisfaction problem - Schiex, Verfaillie - 1994
66	A rearrangement search strategy for determining propositional satisfiability - Zabih, McAllester - 1988
60	A transitive closure algorithm for test generation - Chakradhar, Agrawal, et al. - 1993
49	Recursive Learning: An Attractive Alternative to the Decision Tree for Test Generation - Kunz, Pradhan - 1992
35	Improved Deterministic Test Pattern Generation with Applications to Redundancy Identification - Schulz, Auth - 1989
17	Search State Equivalence for Redundancy Identification and Test Generation - Giraldi, Bushnell - 1991
10	Dynamic Search-Space Pruning Techniques in Path Sensitization - Silva, Sakallah - 1994
9	Sakallah, "GRASP---A New Search Algorithm for Satisfiability - Silva, A - 1996
6	Combinational Test Generation Using Satisfiability," Memorandum no - Stephan, Brayton, et al. - 1992
1	Improvements to Propositional Satifiabi/ity Search Algorithms - Freeman - 1995
1	Computers and Intractabi/ity: A Guide to the Theory ofNP-Comp/etenes - Garey, Johnson - 1979
1	Dynamic Backtracking,"Journa/ofArtificia - Ginsberg - 1993
1	Ejcient Generation or'st Palterns [5'ing Boolean Satisffabi/i - Larrabee - 1990
1	Search A/gorithms j3r Sati,fiabi/ity Problems in Combinational Switching Circuits - Silva - 1995