Abstraction-based relevancy testing for model elimination

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

Volumn 1632, Issue , 1999, Pages 344-358

  Fuchs, Marc ^a   Fuchs, Dirk ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; AUTOMATION; THEOREM PROVING; VERIFICATION;

APPLICATION AREA; AUTOMATED THEOREM PROVER; AUTOMATIC GENERATION; FORMAL SOFTWARE VERIFICATIONS; PROOF PROCEDURES;

ABSTRACTING;

EID: 84957695998     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48660-7_31     Document Type: Conference Paper

References (15)

1. D. Barker-Plummer. Gazing: An Approach to the Problem of Definition and Lemma Use. JAR, 8:311-344, 1992.
2. M. Fuchs. Abstraction-Based Relevancy Testing for Model Elimination. AR-Report AR-98-5, 1998, Technische Universitat Munchen, Institut fur Informatik, 1998.
3. M. Fuchs. Relevancy-Based Lemma Selection for Model Elimination using Lazy Tableaux Enumeration. In Proc. ECAI-98, pages 346-350, 1998.
4. M. Fuchs. System Description: Similarity-Based Lemma Generation for Model Elimination. In Proceedings of CADE-15, pages 33-37, 1998.
5. F. Giunchiglia and T. Walsh. A Theory of Abstraction. AI, 56(2-3):323-390, 1992.
6. R. Korf. Macro-Operators: A Weak Method for Learning. AI, 26:35-77, 1985.
7. R. Letz, K. Mayr, and C. Goller. Controlled Integration of the Cut Rule into Connection Tableau Calculi. JAR, 13:297-337, 1994.
8. D.W. Loveland. Automated Theorem Proving: a Logical Basis. North-Holland, 1978.
9. M. Moser, O. Ibens, R. Letz, J. Steinbach, C. Goller, J. Schumann, and K. Mayr. The Model Elimination Provers SETHEO and E-SETHEO. JAR, 18(2), 1997.
10. D.A. Plaisted. Theorem Proving with Abstraction. AI, 16:47-108, 1981.
11. D.A. Plaisted. Abstraction Using Generalization Functions. In Proceedings of CADE-8, pages 365-376, 1986.
12. D.A. Plaisted. Mechanical Theorem Proving. In Formal Techniques in Artificial Intelligence. Elsevier Science Publisher B.V., 1990.
13. J. Schumann. Delta - a bottom-up preprocessor for top-down theorem provers system abstract. In Proceedings of CADE-12, 1994.
14. M.E. Stickel. A prolog technology theorem prover: Implementation by an extended prolog compiler. JAR, 4:353-380, 1988.
15. J.D. Tenenberg. Preserving Consistency across Abstraction Mappings. In Proceedings of IJCAI-87, pages 1011-1014, 1987.