A confluent connection calculus

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

Volumn 1632, Issue , 1999, Pages 329-343

  Baumgartner, Peter ^a   Eisinger, Norbert ^b   Furbach, Ulrich ^a  

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

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; BIOMINERALIZATION; PATHOLOGY; THEOREM PROVING;

BACKTRACK FREE; CONNECTION METHOD; CONTROL REGIMES; FIRST ORDER; NEW RESULTS; PROOF PROCEDURES; SEARCH STRATEGIES; STRONG COMPLETENESS;

CALCULATIONS;

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

References (19)

1. F. Baader and K. U. Schulz. Unification Theory. In W. Bibel and P. H. Schmitt, editors, Automated Deduction. A Basis for Applications. Kluwer, 1998.
2. P. Baumgartner. Hyper Tableaux — The Next Generation. In H. de Swaart, editor, Automated Reasoning with Analytic Tableaux and Related Methods. LNAI 1397, Springer, 1998.
3. P. Baumgartner, N. Eisinger, and U. Furbach. A Confluent Connection Calculus. Fachberichte Informatik 23-98, Universitat Koblenz-Landau, Universitat Koblenz- Landau, D-56075 Koblenz, 1998.
4. P. Baumgartner, U. Furbach, and I. Niemela. Hyper Tableaux. In Proc. JELIA 96, LNAI 1126. Springer, 1996.
5. B. Beckert and J. Posegga. leanTP: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3):339-358, 1995.
6. W. Bibel. Automated Theorem Proving. Vieweg, 2nd edition, 1987.
7. J.-P. Billon. The Disconnection Method. In P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Theorem Proving with Analytic Tableaux and Related Methods, LNAI 1071. Springer, 1996.
8. F. Bry and N. Eisinger. Unit resolution tableaux. Research Report PMS-FB-1996-Institut fuar Informatik, LMU Muanchen, 1996.
9. M. Fitting. First Order Logic and Automated Theorem Proving. Texts and Mono-graphs in Computer Science. Springer, 1990.
10. H. Fujita and R. Hasegawa. A Model Generation Theorem Prover in KL1 using a Ramified-Stack Algorithm. In Proc.8th of the Eighth International Conference on Logic Programming, pages 535-548, Paris, France, 1991.
11. R. Hahnle, B. Beckert, and S. Gerberding. The Many-Valued Theorem Prover 3TAP. Interner Bericht 30/94, Universitat Karlsruhe, 1994.
12. R. Hähnle and S. Klingenbeck. A-Ordered Tableaux. Journal of Logic and Computation, 6(6):819-833, 1996.
13. R. Hahnle and C. Pape. Ordered tableaux: Extensions and applications. In Galmiche, editor, Automated Reasoning with Analytic Tableaux and Related Methods, LNAI 1227, pages 173-187. Springer, 1997.
14. S. Klingenbeck and R. Hahnle. Semantic tableaux with ordering restrictions. In A. Bundy, editor, CADE 12, LNAI 814, pages 708-722. Springer, 1994.
15. D. Loveland. Mechanical Theorem Proving by Model Elimination. JACM, 15(2), 1968.
16. R. Manthey and F. Bry. SATCHMO: a theorem prover implemented in Prolog. In Lusk and R. Overbeek, editors, CADE 9, LNCS 310, pages 415-434. Springer, 1988.
17. D. A. Plaisted and Y. Zhu. Ordered Semantic Hyper Linking. In Proceedings of AAAI-97, 1997.
18. D. Prawitz. An improved proof procedure. Theoria, 26:102-139, 1960.
19. A. Voronkov. Strategies in rigid-variable methods. In IJCAI 97, Nagoya, 1997.