The tableau-based theorem prover 3TA P Version 4.0

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

Volumn 1104, Issue , 1996, Pages 303-307

  Beckert, Bernhard ^a   Hähnle, Reiner ^a   Oel, Peter ^a   Sulzmann, Martin ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957644043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61511-3_95     Document Type: Conference Paper

References (20)

1. Bernhard Beckert. A completion-based method for mixed universal and rigid E-unification. In A. Bundy, editor, Proceedings, 12th International Conference on Automated Deduction (CADE), Nancy, France, LNCS 814, pages 678-692. Springer, 1994.
2. Bernhard Beckert, Reiner Hähnle, Karla Geiβ, Peter Oel, Christian Pape, and Martin Sulzmann. The many-valued tableau-based theorem prover 3TAP, version 4.0. Intemer Bericht. 3/96, Universität Karlsruhe, Fakultät für Informatik, 1996.
3. Bernhard Beckert, Reiner Hähnle, and Peter H. Schmitt. The even more liberalized δ-nüe in free variable semantic tableaux. In Georg Gottlob, Alexander Leitsch, and Daniele Mundici, editors, Proceedings, 3rd Kurt Gödel Colloquium (KGC), Brno, Czech Republic, LNCS 713, pages 108-119. Springer, 1993.
4. Bernhard Beckert and Christian Pape. Incremental theory reasoning methods for semantic tableaux. In Proceedings, 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Palermo, Italy, LNCS. Springer. 1996.
5. Bernhard Beckert and Joachim Posegga. leanTAP: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3):339-358, 1995.
6. Marcello D'Agostino, Dov Gabbay. Reiner Hähnle, and Joachim Posegga, editors. Handbook of Tableau Methods. Kluwer, Dordrecht, 1996. To appear.
7. Marcello D'Agostino and Marco Mondadori. The taming of the cut. Journal of Logic and Computation, 4(3), 1994.
8. Melvin C. Fitting. First-Order Logic and Automated Theorem Proving. Springer. 2nd edition, 1996.
9. Reiner Hähnle. Towards an efficient tableau proof procedure for multiple-valued logics. In Proceedings, Workshop on Computer Science Logic, Heidelberg, Germany, LNCS 533, pages 248-260. Springer, 1990.
10. Reiner Hähnle. Automated Deduction in Multiple-valued Logics, volume 10 of International Series of Monographs on Computer Science. Oxford University Press. 1994.
11. Reiner Hähnle and Werner Kernig. Verification of switch level designs with manyvalued logic. In A. Voronkov, editor, Proceedings, 4th International Conference on Logic Programming and Automated Reasoning (LPAR), St. Petersburg, Russia, LNCS 698, pages 158-169. Springer, 1993.
12. Reiner Hähnle and Peter H. Schmitt. The liberalized á-rule in free variable semantic tableaux. Journal of Automated Reasoning, 13(2):211-222, 1994.
13. Reinhold Letz, Klaus Mayr, and C. Goller. Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning, 13(3):297-338. December 1994.
14. F. Oppacher and E. Suen. HARP: A tableau-based theorem prover. Journal of Automated Reasoning, 4:69-100, 1988.
15. Steve Reeves. Semantic tableaux as a framework for automated theorem-proving. In C. S. Mellish and J. Hallam, editors, Advances in Artificial Intelligence (Proceedings of AISB-87), pages 125-139. Wiley, 1987.
16. Wolfgang Reif. The KlV-syst.em: Systematic construction of verified software. In Proceedings, 11th International Conference on Automated Deduction (CADE), Saratoga Springs, NY, USA, LNCS 607, pages 253-267. Springer. 1992.
17. Wolfgang Reif, Gerhard Schellhom, and Kurt Stenzel. Interactive correctness proofs for software modules using KIV. In Proceedings, 10th Annual Conference on Computer Assurance (COMPASS), Washington, USA, pages 151-162, 1994.
18. Peter H. Schmitt. Computational aspects of three-valued logic. In J. H. Siek- mann, editor, Proceedings, 8th International Conference on Automated Deduction (CADE), LNCS, pages 190-198. Springer, 1986.
19. Raymond M. Smullyan. First-Order Logic. Dover Publications, New York, second corrected edition, 1995. First published 1968 by Springer-Verlag.
20. Geoff Sutcliffe, Christian Suttner, and Theodor Yemenis. The TPTP problem library. In A. Bundy, editor, Proceedings, 12th International Conference on Automated Deduction (CADE), Nancy, France, LNCS 814, pages 708-722. Springer, 1994. Current version available on the World Wide Met at the URL http://www.cs.jcu.edu.au/ftp/users/GSutcliffe/TPTP.HTML.