Lemma and cut strategies for propositional model elimination

Annals of Mathematics and Artificial Intelligence

Volumn 26, Issue 1-4, 1999, Pages 113-132

  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: 0033263531     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018950727018     Document Type: Article

References (21)

1. O.L. Astrachan and D.W. Loveland, The use of lemmas in the model elimination procedure, J. Automated Reasoning 19 (1997) 117-141.
2. O.L. Astrachan and M.E. Stickel, Caching and lemmaizing in model elimination theorem provers, in: Automated Deduction - CADE-11. Proceedings of 11th International Conference on Automated Deduction, ed. D. Kapur, Saratoga Springs, NY, 15-18 June 1992 (Springer, Berlin, 1992) pp. 224-238.
3. M. Dalal and D. Etherington, A hierarchy of tractable satisfiability problems, Inform. Process. Lett. 44 (1992) 173-180.
4. 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.
5. D.S. Johnson and M.A. Trick, eds., Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26 (Amer. Math. Soc., Providence, RI, 1996).
6. T. Larrabee, Test pattern generation using Boolean satisfiability, IEEE Trans. Comput.-Aided Design 11(1) (1992) 6-22.
7. T. Larrabee and Y. Tsuji, Evidence for a satisfiability threshold for random 3CNF formulas, Technical Report UCSC-CRL-92-42, UC Santa Cruz, Santa Cruz, CA (October 1992).
8. 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.
9. D.W. Loveland, Mechanical theorem-proving by model elimination, Journal of the ACM 15(2) (1968) 236-251.
10. D.W. Loveland, A simplified format for the model elimination theorem-proving procedure, Journal of the ACM 16(3) (1969) 349-363.
11. D.W. Loveland, Automated Theorem Proving: A Logical Basis (North-Holland, Amsterdam, 1978).
12. J. Minker and G. Zanon, An extension to linear resolution with selection function, Inform. Process. Lett. 14(3) (1982) 191-194.
13. D. Mitchell, B. Selman and H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92), San Jose, CA (July 1992) pp. 459-465.
14. n steps, Discrete Appl. Math. 10 (1985) 287-295.
15. R.E. Shostak, A graph-theoretic view of resolution theorem-proving, Ph.D. thesis, Center for Research in Computing Technology, Harvard University (1974). Also available from CSL, SRI International, Menlo Park, CA.
16. R.E. Shostak, Refutation graphs, Artif. Intell. 7 (1976) 51-64.
17. J.P. Silva and K.A. Sakallah, GRASP - a new search algorithm for satisfiability, in: Proc. IEEE/ACM Int'l Conf. on Computer-Aided Design (IEEE Computer. Society Press, Los Alamitos, CA, 1996) pp. 220-227.
18. 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.
19. A. Van Gelder, Autarky pruning in propositional model elimination reduces failure redundancy, J. Automated Reasoning 23(2) (1999) 137-193.
20. A. Van Gelder and Y.K. Tsuji, Satisfiability testing with more reasoning and less guessing, 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, 1996).
21. H. Zhang, SATO: An efficient propositional prover, in: 14th International Conference on Automated Deduction (1997) pp. 272-275.