A propositional theorem prover to solve planning and other problems

Annals of Mathematics and Artificial Intelligence

Volumn 26, Issue 1-4, 1999, Pages 87-112

  Van Gelder, Allen ^b   Okushi, Fumiaki ^a,b  

^a Electronics for Imaging   (United States)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033267434     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018998610179     Document Type: Article

References (35)

1. R. Anderson and W.W. Bledsoe, A linear format for resolution with merging and a new technique for establishing completeness, Journal of the ACM 17(3) (1970) 525-534.
2. O.L. Astrachan and D.W. Loveland, The use of lemmas in the model elimination procedure, J. Automated Reasoning 19 (1997) 117-141.
3. M. Dalal and D. Etherington, A hierarchy of tractable satisfiability problems, Inform. Process. Lett. 44 (1992) 173-180.
4. M. Davis, G. Logemann and D. Loveland, A machine program for theorem-proving, Comm. of the ACM 5 (1962) 394-397.
5. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7 (1960) 201-215.
6. M.D. Ernst, T.D. Millstein and D.S. Weld, Automatic SAT-compilation of planning problems, in: 15th International Joint Conference on Artificial Intelligence (1997) pp. 1169-1176.
7. S. Fleisig, D.W. Loveland, A.K. Smiley and D.L. Yarmush, An implementation of the model elimination proof procedure, Journal of the ACM 21(1) (1974) 124-139.
8. R.E. Fikes and N.J. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence 2(3/4) (1971) 189-208.
9. I.P. Gent and T. Walsh, Towards an understanding of hill-climbing procedures for SAT, in: Proceedings of the Eleventh National Conference on Artificial Intelligence, AAAI-93 and IAAI-93, Washington, DC, 11-15 July 1993 (AAAI Press, Menlo Park, CA, 1993) pp. 28-33.
10. F. Giunchiglia and R. Sebastiani, Building decision procedures for modal logics from propositional decision procedures - the case study of modal K, in: 13th International Conference on Automated Deduction (Springer, Berlin, 1996) pp. 583-597.
11. H. Kautz and B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search, in: 13th National Conference on Artificial Intelligence (1996) pp. 1194-1201.
12. R. Kowalski and D. Kuehner, Linear resolution with selection function, Artificial Intelligence 2(2/3) (1971) 227-260.
13. R.A. Kowalski, Logic for Problem Solving (North-Holland, Amsterdam, 1979).
14. T. Larrabee, Test pattern generation using Boolean satisfiability, IEEE Trans. Comput. Aided Design 11(1) (1992) 6-22.
15. S.-J. Lee and D.A. Plaisted, Eliminating duplication with the hyper-linking strategy, J. Automated Reasoning 9(1) (1992) 25-42.
16. R. Letz, K. Mayr and C. Goller, Controlled integration of the cut rule into connection tableau calculi, J. Automated Reasoning 13(3) (1994) 297-337.
17. D.W. Loveland, A simplified format for the model elimination theorem-proving procedure, Journal of the ACM 16(3) (1969) 349-363.
18. D.W. Loveland, A unifying view of some linear Herbrand procedures, Journal of the ACM 19(2) (1972) 366-384.
19. J. Minker and G. Zanon, An extension to linear resolution with selection function, Inform. Process. Lett. 14(3) (1982) 191-194.
20. n steps, Discrete Appl. Math. 10 (1985) 287-295.
21. N. Nilsson, Principles of Artificial Intelligence (Tioga, Palo Alto, CA, 1980).
22. F. Okushi, Parallel cooperative propositional theorem proving, Ann. Math. Artificial Intelligence 26 (this issue) (1999) 59-85.
23. D.A. Plaisted, The search efficiency of theorem proving strategies, in: 12th International Conference on Automated Deduction (Springer, Berlin, 1994) pp. 57-71.
24. B. Selman, H.A. Kautz and B. Cohen, Local search strategies for satisfiability testing, in: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, eds. D.S. Johnson and M. Trick, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (Amer. Math. Soc., Providence, RI, 1995).
25. B. Selman, H. Levesque and D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92), San Jose, CA (July 1992) pp. 440-446.
26. R.E. Shostak, Refutation graphs, Artificial Intelligence 7 (1976) 51-64.
27. J.P. Silva and K.A. Sakallah, GRASP - a new search algorithm for satisfiability, in: Proc. IEEE/ACM Int. Conf. on Computer-Aided Design (IEEE Computer Society Press, Los Alamitos, CA, 1996) pp. 220-227.
28. M.E. Stickel, Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction, J. Automated Reasoning 13(2) (1994) 189-210.
29. M.H. Van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, Journal of the ACM 23(4) (1976) 733-742.
30. A. Van Gelder, Autarky pruning in propositional model elimination reduces failure redundancy, J. Automated Reasoning 23(2) (1999) 137-193.
31. A. Van Gelder and F. Okushi, Lemma and cut strategies for propositional model elimination, Ann. Math. Artificial Intelligence 26 (this issue) (1999) 113-132.
32. A. Van Gelder and Y.K. Tsuji, Incomplete thoughts about incomplete satisfiability procedures, in: Second DIMACS Challenge Workshop: Cliques, Coloring and Satisfiability (October 1993).
33. A. Van Gelder and Y.K. Tsuji, Satisfiability testing with more reasoning and less guessing, in: Cliques, Coloring, and Satisfiability, eds. D.S. Johnson and M. Trick, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26 (Amer. Math. Soc., Providence, RI, 1996) pp. 559-586.
34. H. Zhang, SATO: An efficient propositional prover, in: 14th International Conference on Automated Deduction (1997) pp. 272-275.
35. H. Zhang and M. Stickel, Implementing the Davis-Putnam algorithm by tries, Technical report, Department of Computer Science, University of Iowa (1994).