Download:
|
by I. Lynce, L. Baptista, J. Marques-silva
In Proceedings of the International Symposium on Theory and Applications of Satisfiability Testing
http://www-users.cs.york.ac.uk/~tw/fall/Proceedings/silva-legal.ps
Add To MetaCart
Abstract:
This paper proposes a general framework for implementing backtracking search strategies in Propositional Satis ability (SAT) algorithms, that is referred to as unrestricted backtracking. Dierent organizations of unrestricted backtracking yield well-known backtracking search strategies. Moreover, this general framework allows devising new backtracking strategies. For example, we propose a stochastic systematic search algorithm for SAT, that randomizes both the variable selection and the backtracking steps of the algorithm. In addition, we illustrate how unrestricted backtracking can be used to develop informed search restart strategies, that only eliminate variable selections that are deemed relevant for the set of con
icts identied prior to each restart. Finally, experimental results provide empirical evidence that dierent organizations of unrestricted backtracking can result in competitive approaches for solving hard real-world instances of SAT.
Citations
|
307
|
A machine program for theorem-proving
– Davis, Logemann, et al.
- 1962
|
|
305
|
Dynamic backtracking
– Ginsberg
- 1993
|
|
223
|
GRASP-a search algorithm for propositional satisfiability
– Silva, Sakallah
- 1999
|
|
221
|
Boosting combinatorial search through randomization
– Gomes, Selman, et al.
- 1998
|
|
195
|
DomainIndependent Extensions to GSAT: Solving Large Structured Satisfiability
– Selman, Kautz
- 1993
|
|
135
|
Evidence for invariants in local search
– McAllester, Selman, et al.
- 1997
|
|
130
|
Using CSP look-back techniques to solve real-world SAT instances
– Schrag
- 1997
|
|
64
|
A computing procedure for quanti theory
– Davis, Putnam
- 1960
|
|
64
|
Cha: Engineering an Ecient SAT Solver
– Moskewicz, Madigan, et al.
- 2001
|
|
61
|
A rearrangement search strategy for determining propositional satisfiability
– Zabih, McAllester
- 1988
|
|
48
|
Look-Ahead Versus Look-Back for Satisfiability Problems
– Li, Anbulagan
- 1997
|
|
44
|
Using randomization and learning to solve hard real-world instances of satisfiability
– Baptista, Marques-Silva
- 2000
|
|
44
|
SATO: An ecient propositional prover
– Zhang
- 1997
|
|
32
|
A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
– Prestwich
- 2000
|
|
31
|
Using CSP look-back techniques to solve realworld SAT instances
– Jr, J, et al.
- 1997
|
|
25
|
GRASP: A new search algorithm for satis
– Marques-Silva, Sakallah
- 1996
|
|
14
|
Superscalar processor veri using ecient reductions from the logic of equality with uninterpreted functions to propositional logic
– Velev, Bryant
- 1999
|
|
13
|
Complete Search Restart Strategies for Satisfiability
– Baptista, Lynce, et al.
- 2001
|
|
8
|
Non-systematic search and no-good learning
– Richards, Richards
- 2000
|
|
6
|
Restart-repair and learning: An empirical study of single solution 3-sat problems
– Richards, Richards
- 1997
|
|
2
|
Engineering a (super?) ecient SAT solver
– Moskewicz, Madigan, et al.
- 2001
|
|
2
|
Superscalar processor veri cation using ecient reductions from the logic of equality with uninterpreted functions to propositional logic
– Velev, Bryant
- 1999
|
