LeanT A P: Lean tableau-based theorem proving-Reference-Cited by-同舟云学术

LeanT A P: Lean tableau-based theorem proving

Published:1994 Issue: Volume: Page:793-797
ISSN:0302-9743
Container-title:Automated Deduction — CADE-12
language:
Short-container-title:

Author:

Beckert Bernhard,Posegga Joachim

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58156-1_62

Reference10 articles.

1. B. Beckert, S. Gerberding, R. Hähnle, and W. Kernig. The tableau-based theorem prover 3TAP for multiple-valued logics. In Proceedings, CADE 11, Albany/NY, LNCS. Springer, 1992.

2. B. Beckert and R. Hähnle. An improved method for adding equality to free variable semantic tableaux. In Proceedings, CADE 11, Albany/NY, LNCS. Springer, 1992.

3. B. Beckert, R. Hähnle, and P. H. Schmitt. The even more liberalized δ-rule in free variable semantic tableaux. In Proceedings, 3rd Kurt Gödel Colloquium, Brno, Czech Republic, LNCS. Springer, 1993.

4. B. Beckert and J. Posegga. leanTAP: Lean tableau-based theorem proving. To appear (available upon request from the authors), 1994.

5. E. Eder. Relative Complexities of First-Order Calculi. Artificial Intelligence. Vieweg Verlag, 1992.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic;Lecture Notes in Computer Science;2005

2. lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic;Automated Reasoning;2001

3. Incremental Closure of Free Variable Tableaux;Automated Reasoning;2001

4. First-Order Tableau Methods;Handbook of Tableau Methods;1999

5. linTAP : A Tableau Prover for Linear Logic;Lecture Notes in Computer Science;1999