Probe order backtracking

SIAM Journal on Computing

Volumn 26, Issue 2, 1997, Pages 456-483

  Purdom Jr , Paul Walton ^a   Haven, G Neil ^b  

^a INDIANA UNIVERSITY   (United States)

^b Autospect Inc   (United States)

Author keywords

Average time; Backtracking; Combinatorial search; NP complete; Satisfiability; Searching

Indexed keywords

EID: 0004267179     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793256053     Document Type: Article

References (21)

1. C. A. BROWN AND P. W. PURDOM, An average time analysis of backtracking, SIAM J. Comput., 10 (1981), pp. 583-593.
2. K. M. BUGRARA AND C. A. BROWN, The average case analysis of some satisfiability model problems, Inform. Sci., 40 (1986), pp. 21-38.
3. K. M. BUGRARA AND P. W. PURDOM, Average time analysis of clause order backtracking, SIAM J. Comput., 23 (1993), pp. 303-317.
4. K. M. BUGRARA, Y. F. PAN, AND P. W. PURDOM, Exponential average time for the pure literal rule, SIAM J. Comput., 18 (1988), pp. 409-418.
5. M. BURO AND H. K. BÜNING, Report on a SAT competition, Bull. European Assoc. Theoret. Comput. Sci., 49 (1993), pp. 143-151.
6. J. V. FRANCO, On the probabilistic performance of algorithms for the satisfiability problem, Inform. Process. Lett., 18 (1986), pp 103-106.
7. J. V. FRANCO, On the occurrence of null clauses in random instances of satisfiability, Discrete Appl. Math., 41 (1993), pp. 203-210.
8. J. V. FRANCO, Elimination of infrequent variables improves average case performance of satisfiability algorithms, SIAM J. Comput., 20 (1991), pp. 1119-1127.
9. K. IWAMA, CNF satisfiability test by counting and polynomial average time, SIAM J. Comput., 18 (1989), pp. 385-391.
10. K. J. LIEBERHERR AND E. SPECKER, Complexity of partial satisfaction, J. Assoc. Comput. Mach., 28 (1981), pp. 411-421.
11. H. M. MÉJEAN, H. MOREL, G. REYNAUD, A variational method for analysing unit clause search, SIAM J. Comput., 24 (1995), pp. 621-649.
12. A. NEWELL AND H. A. SIMON, GPS, a program that simulates human thought, in Computers and Thought, E. A. Feigenbaum and J. Feldman, eds., McGraw-Hill, New York, 1963, pp. 279-296.
13. P. W. PURDOM, Search rearrangement backtracking and polynomial average time, Artif. Intell., 21 (1983), pp. 117-133.
14. P. W. PURDOM, A survey of average time analyses of satisfiability algorithms, J. Inform. Process., 13 (1990), pp. 449-455; an earlier version appeared as Random satisfiability problems, in Proc. International Workshop on Discrete Algorithms and Complexity, Institute of Electronics, Information and Communication Engineers, Tokyo, 1989, pp. 253-259.
15. P. W. PURDOM, A survey of average time analyses of satisfiability algorithms, J. Inform. Process., 13 (1990), pp. 449-455; an earlier version appeared as Random satisfiability problems, in Proc. International Workshop on Discrete Algorithms and Complexity, Institute of Electronics, Information and Communication Engineers, Tokyo, 1989, pp. 253-259.
16. P. W. PURDOM, Average time for the full pure literal rule, Inform. Sci., 78 (1994), pp 269-291.
17. P. W. PURDOM AND C. A. BROWN, An analysis of backtracking with search rearrangement, SIAM J. Comput., 12 (1983), pp. 717-733.
18. P. W. PURDOM AND C. A. BROWN, The pure literal rule and polynomial average time, SIAM J. Comput., 14 (1985), pp. 943-953.
19. P. W. PURDOM AND C. A. BROWN, Polynomial-average-time satisfiability problems, Inform. Sci., 41 (1987), pp. 23-42.
20. P. W. PURDOM AND G. N. HAVEN, Backtracking and probing, Technical Report 387, Department of Computer Science, Indiana University, Bloomington, IN, 1993.
21. R. SOSIČ AND J. Gu, Fast search algorithms for the n-queens problem, IEEE Trans. Systems Man Cybernet., 21 (1991), pp. 1572-1576.