PROTEIN: A PROver with a Theory extension INterface

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

Volumn 814 LNAI, Issue , 1994, Pages 769-773

  Baumgartner, Peter ^a   Furbach, Ulrich ^a  

^a Institut für Informatik ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; PROTEINS; THEOREM PROVING;

FIRST ORDER; THEOREM PROVERS;

CASE BASED REASONING;

EID: 84946768912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58156-1_57     Document Type: Conference Paper

References (17)

1. P. Baumgartner. A Model Elimination Calculus with Built-in Theories. In H.-J. Ohlbach, editor, Proceedings of the 16-th German Al-Conference (GWAI-92), pages 30-42. Springer, 1992. LNAI 671.
2. P. Baumgartner. Linear Completion: Combining the Linear and the Unit-Resulting Restrictions. Research Report 9/93, Universität of Koblenz, 1993.
3. P. Baumgartner. Refinements of Theory Model Elimination and a Variant without Contrapositives. In Proc. ECAI’94, 1994. (to appear).
4. P. Baumgartner and U. Furbach. Model Elimination without Contrapositives and its Application to PTTP. Fachberichtlnformatik 12/93, Uni versitat Koblenz, 1993. (short version in Proc. CADE-12).
5. P. Baumgartner and U. Furbach. Model Elimination without Contrapositives. In Proc. 12th International Conference on Automated Deduction. Springer, 1994. (in this volume).
6. P. Baumgartner, U. Furbach, and U. Petermann. A Unified Approach to Theory Reasoning. Forschungsbericht 15/92, University of Koblenz, 1992. (submitted to Journal of Automated Reasoning).
7. W. W. Bledsoe. Challenge Problems in Elementary Calculus. Journal of Automated Reasoning, 6:341-359,1990.
8. Manfred Kerber, Erica Melis, and Jörg Siekmann. Reasoning with Assertions and Examples. Technical Report SEKI Report SR-93-10, Universität des Saarlandes, Fachbereich Informatik, 1993.
9. D. Loveland. A Simplified Version for the Model Elimination Theorem Proving Procedure. JACM, 16(3), 1969.
10. D.W. Loveland. Near-Horn Prolog. In J.-L. Lassez, editor, Proc. of the 4th Int. Conf. on Logic Programming, pages 456-469. The MIT Press, 1987.
11. R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A High-Performace Theo­rem Prover. Journal of Automated Reasoning, 8(2), 1992.
12. D. Plaisted. Non-Horn Clause Logic Programming Without Contrapositives. Journal of Automated Reasoning, 4:287-325,1988.
13. D. W. Reed and D. W. Loveland. A Comparison of Three Prolog Extensions. Journal of Logic Programming, 12:25-50,1992.
14. G. Sutcliffe, C. Suttner, and T. Yemenis. The TPTP problem library. In Proc. CADE-12. Springer, 1994.
15. M.E. Stickel. Automated Deduction by Theory Resolution. Journal of Automated Reasoning, 1:333-355,1985.
16. M. Stickel. A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler. Journal of Automated Reasoning, 4:353-380,1988.
17. M. Stickel. A Prolog Technology Theorem Prover. In M.E. Stickel, editor, Proc CADE 10, LNCS 449, pages 673-675. Springer, 1990.