System description: Similarity- based lemma generation for model elimination

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

Volumn 1421, Issue , 1998, Pages 33-37

  Fuchs, Marc ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (9)

1. O.L. Astrachan and D.W. Loveland. The Use of Lemmas in the Model Elimination Procedure. Journal of Automated Reasoning, 19(1): 117-141, 1997.
2. M. Fuchs. Controlled Use of Clausal Lemmas in Connection Tableau Calculi. AR-Report, AR-98-02, TU München.
3. M. Fuchs. Flexible proof replay with heuristics. In Proc. EPIA-97, LNAI 1323, pages 1-12. Springer, 1997.
4. R. Letz, K. Mayr, and C. Goller. Controlled Integration of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, (13): 297-337, 1994.
5. D.W. Loveland. Automated Theorem Proving: a Logical Basis. North-Holland, 1978.
6. R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A High-Performance Theorem Prover. Journal of Automated Reasoning, 8(2): 183-212, 1992.
7. S. Minton. Quantitative Results Concerning the Utility of Explanation-Based Learning. Artificial Intelligence, (42): 363-391, 1990. Elsevier Science Publishers.
8. J. Schumann. Delta-a bottom-up preprocessor for top-down theorem provers. In Proc. CADE-12. Springer, 1994.
9. M.E. Stickel. A prolog technology theorem prover: Implementation by an extended prolog compiler. Journal of Automated Reasoning, 4: 353-380, 1988.