Subgoal alternation in model elimination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1227, Issue , 1997, Pages 201-215

  Ibens, Ortrun ^a   Letz, Reinhold ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ELIMINATION PROCEDURE; SEARCH SPACES; SELECTION METHODS; SUBGOALS; THEOREM PROVERS;

ARTIFICIAL INTELLIGENCE;

EID: 52649122267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0027415     Document Type: Conference Paper

References (17)

1. O. L. Astrachan, M. E. Stickel. Caching and Lemmaizing in Model Elimination Theorem Provers. CADE-11, LNAI 607, p. 224-238, Springer, 1992.
2. D. Brand. Proving theorems with the modification method. SIAM Journal of Computing, 4(4):412-430, 1975.
3. M. Fitting. First-Order Logic and Automated Theorem Proving, Springer, 1990.
4. C. Goller, R. Letz, K. Mayr, J. Schumann. SETHEO V3.2: Recent Developments - System Abstract -. CADE-12, LNAI 814, p. 778-782, Springer, 1994.
5. J. Harrison. Optimizing proof search in model elimination. CADE-13, LNAI 1104, p. 313-327, Springer, 1996.
6. R. Letz. First-Order Calculi and Proof Procedures for Automated Deduction. Dissertation, Technische Hochschule Darmstadt, 1993.
7. R. Letz, J. Schumann, S. Bayerl, W. Bibel. SETHEO: A High-Performance. Theorem Prover. Journal of Automated Reasoning, 8:183-212, 1992.
8. R. Letz, K. Mayr, C. Goller. Controlled Integration of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13:297-337, 1994.
9. D. W. Loveland. Automated theorem proving: A logical basis. North Holland, New York, 1978.
10. M. Moser, C. Lynch, J. Steinbach. Model elimination with basic ordered paramodulation. Technical Report AR-95-11, Institut fiir Informatik, Technische Universität München, 1995.
11. M. Moser. Goal-directed reasoning in clausal logic with equality. Dissertation, Institut für Informatik, TU München, 1996.
12. M. Moser. Compiling basic paramodulation to logic. Technical report, Institut füt Informatik, TU München, 1997.
13. M. Moser, O. Ibens, R. Letz, J. Steinbach, C. Goller, J. Schumann, K. Mayr. SETHEO and E-SETHEO. Special issue of the Journal of Automated Reasoning, to appear 1997.
14. G. A. Robinson, L. Wos. Paramodulation and theorem proving in first-order theories with equality. Machine Intelligence, 4:135-150, 1969.
15. R. E. Shostak. Refutation graphs. Artificial Intelligence, 7:51-64, 1976.
16. M. E. Stickel. A Prolog technology theorem prover: Implementation by an extended Prolog compiler. Journal of Automated Reasoning, 4:353-380, 1988.
17. G. Sutcliffe, C.B. Suttner, T. Yemenis. The TPTP problem library. CADE-12, LNAI 814 of, p. 778-782, Springer, 1994.