Random backtracking in backtrack search algorithms for satisfiability

Discrete Applied Mathematics

Volumn 155, Issue 12, 2007, Pages 1604-1612

  Lynce, I ^a   Marques Silva, J ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Backtrack search algorithms; Propositional satisfiability; Randomization

Indexed keywords

HEURISTIC METHODS; PROBLEM SOLVING; RANDOM PROCESSES; RANDOM VARIABLES;

BACKTRACK SEARCH ALGORITHMS; PROPOSITIONAL SATISFIABILITY; RANDOMIZATION; VARIABLE SELECTION HEURISTICS;

ALGORITHMS;

EID: 34250214528     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.10.021     Document Type: Article

References (21)

1. F. Bacchus, Exploiting the computational tradeoff of more reasoning and less searching, in: Fifth International Symposium on Theory and Applications of Satisfiability Testing, 2002, pp. 7-16.
2. Baptista L., and Marques-Silva J.P. Using randomization and learning to solve hard real-world instances of satisfiability. In: Dechter R. (Ed). International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science vol. 1894 (2000), Springer, Berlin 489-494
3. R. Bayardo Jr., R. Schrag, Using CSP look-back techniques to solve real-world SAT instances, in: Proceedings of the National Conference on Artificial Intelligence, 1997, pp. 203-208.
4. Davis M., Logemann G., and Loveland D. A machine program for theorem-proving. Commun. Assoc. Comput. Mach. 5 (1962) 394-397
5. Davis M., and Putnam H. A computing procedure for quantification theory. J. Assoc. Comput. Mach. 7 (1960) 201-215
6. J.W. Freeman, Improvements to propositional satisfiability search algorithms, Ph.D. Thesis, University of Pennsylvania, Philadelphia, PA, May 1995.
7. Ginsberg M. Dynamic backtracking. J. Artif. Intell. Res. 1 (1993) 25-46
8. M. Ginsberg, D. McAllester, GSAT and dynamic backtracking, in: Proceedings of the International Conference on Principles of Knowledge and Reasoning, 1994, pp. 226-237.
9. E. Goldberg, Y. Novikov, BerkMin: a fast and robust sat-solver, in: Proceedings of the Design and Test in Europe Conference, 2002, pp. 142-149.
10. C.P. Gomes, B. Selman, H. Kautz, Boosting combinatorial search through randomization, in: Proceedings of the National Conference on Artificial Intelligence, 1998, pp. 431-437.
11. I. Lynce, J. Marques-Silva, Complete unrestricted backtracking algorithms for satisfiability, in: Fifth International Symposium on the Theory and Applications of Satisfiability Testing, 2002, pp. 214-221.
12. D. McAllester, B. Selman, H. Kautz, Evidence of invariants in local search, in: Proceedings of the National Conference on Artificial Intelligence, 1997, pp. 321-326.
13. Marques-Silva J.P., and Sakallah K.A. GRASP-A search algorithm for propositional satisfiability. IEEE Trans. Comput. 48 5 (1999) 506-521
14. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik, Engineering an efficient SAT solver, in: Proceedings of the Design Automation Conference, 2001, pp. 530-535.
15. S. Prestwich, A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences, in: Proceedings of the International Conference on Principles and Practice of Constraint Programming, 2000, pp. 337-352.
16. Richards E.T., and Richards B. Non-systematic search and no-good learning. J. Automat. Reason. 24 4 (2000) 483-533
17. B. Selman, H. Kautz, Domain-independent extensions to GSAT: Solving large structured satisfiability problems, in: Proceedings of the International Joint Conference on Artificial Intelligence, 1993, pp. 290-295.
18. M.N. Velev, R.E. Bryant, Superscalar processor verification using efficient reductions from the logic of equality with uninterpreted functions to propositional logic, in: Proceedings of Correct Hardware Design and Verification Methods, Lecture Notes in Computer Science, vol. 1703, 1999, pp. 37-53.
19. M. Yokoo, Weak-commitment search for solving satisfaction problems, in: Proceedings of the National Conference on Artificial Intelligence, 1994, pp. 313-318.
20. R. Zabih, D.A. McAllester, A rearrangement search strategy for determining propositional satisfiability, in: Proceedings of the National Conference on Artificial Intelligence, 1988, pp. 155-160.
21. H. Zhang, SATO: An efficient propositional prover, in: Proceedings of the International Conference on Automated Deduction, 1997, pp. 272-275.