GRASP: a search algorithm for propositional satisfiability
Marques-Silva, J.P.
Sakallah, K.A.
IST, INESC, Lisbon;
This paper appears in: Computers, IEEE Transactions on
Publication Date: May 1999
Volume: 48,
Issue: 5
On page(s): 506-521
ISSN: 0018-9340
References Cited: 39
CODEN: ITCOB4
INSPEC Accession Number: 6278998
Digital Object Identifier: 10.1109/12.769433
Current Version Published: 2002-08-06
Abstract
This paper introduces GRASP (Generic seaRch Algorithm for the
Satisfiability Problem), a new search algorithm for Propositional
Satisfiability (SAT). GRASP incorporates several search-pruning
techniques that proved to be quite powerful on a wide variety of SAT
problems. Some of these techniques are specific to SAT, whereas others
are similar in spirit to approaches in other fields of Artificial
Intelligence. GRASP is premised on the inevitability of conflicts during
the search and its most distinguishing feature is the augmentation of
basic backtracking search with a powerful conflict analysis procedure.
Analyzing conflicts to determine their causes enables GRASP to backtrack
nonchronologically 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 and
preempt the occurrence of similar conflicts later on in the search.
Finally, straightforward bookkeeping of the causality chains leading up
to conflicts allows GRASP to identify assignments that are necessary for
a solution to be found. Experimental results obtained from a large
number of benchmarks indicate that application of the proposed conflict
analysis techniques to SAT algorithms can be extremely effective for a
large number of representative classes of SAT instances
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
