Clausal connection-based theorem proving in intuitionistic first-order logic

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

Volumn 3702 LNAI, Issue , 2005, Pages 245-261

  Otten, Jens ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); MATRIX ALGEBRA; THEOREM PROVING;

CLASSICAL PROVER LEANCOP; FIRST-ORDER LOGIC; INTUITIONISTIC LOGIC;

FORMAL LOGIC;

EID: 33646184789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554554_19     Document Type: Conference Paper

References (30)

1. th CADE, LNAI 814, pp. 793-797, Springer, 1994.
2. Y. BERTOT, P. CASTÉRAN. Interactive Theorem Proving and Program Development. Texts in Theoretical Computer Science, Springer, 2004.
3. W. BIBEL. Matings in matrices. Communications of the ACM, 26:844-852, 1983.
4. W. BIBEL. Automated Theorem Proving. Vieweg, second edition, 1987.
5. R. L. CONSTABLE ET. AL. Implementing Mathematics with the NuPRL proof development system. Prentice Hall, 1986.
6. R. DYCKHOFF. Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic, 57:795-807, 1992.
7. M. C. FITTING. First-Order Logic and Automated Theorem Proving. Springer, 1990.
8. G. GENTZEN. Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 39:176-210, 405-431, 1935.
9. R. HÄHNLE, P. SCHMITT The Liberalized δ-rule in free variable semantic tableaux. Journal of Automated Reasoning, 13:211-221, 1994.
10. th CADE, LNAI 1249, pp. 207-221, Springer, 1997.
11. C. KREITZ, J. OTTEN. Connection-based theorem proving in classical and non-classical logics. Journal of Universal Computer Science, 5:88-112, Springer, 1999.
12. R. LETZ, J. SCHUMANN, S. BAYERL, W. BIBEL. SETHEO: A high-performance theorem prover. Journal of Automated Reasoning, 8:183-212, 1992.
13. R. LETZ, G. STENZ Model elimination and connection tableau procedures. Handbook of Automated Reasoning, pp. 2015-2114, Elsevier, 2001.
14. D. LOVELAND. Mechanical theorem proving by model elimination. JACM, 15:236-251, 1968.
15. th TABLEAUX Conference, LNAI 1617, pp. 217-231, Springer, 1999.
16. A. MARTELLI, U. MONTANARI. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems (TOPLAS), 4:258-282, 1982.
17. W. MCCUNE. OTTER 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, 1994.
18. H. J. OHLBACH ET AL. Encoding two-valued nonclassical logics in classical logic. Handbook of Automated Reasoning, pp. 1403-1486, Elsevier, 2001.
19. J. OTTEN, W. BIBEL. leanCoP: lean connection-based theorem proving. Journal of Symbolic Computation, 36:139-161, 2003.
20. th TABLEAUX Workshop, LNAI 1071, pp. 244-260, Springer, 1996.
21. J. OTTEN, C. KREITZ. A uniform proof procedure for classical and non-classical logics. KI-96: Advances in Artificial Intelligence, LNAI 1137, pp. 307-319, Springer, 1996.
22. th TABLEAUX Conference, LNAI 1227, pp. 307-312, Springer, 1997.
23. T. RATHS, J. OTTEN, C. KREITZ. The ILTP library: benchmarking automated theorem provers for intuitionistic logic. TABLEAUX 2005, this volume, 2005. (http://www.iltp.de)
24. D. SAHLIN, T. FRANZEN, S. HARIDI. An intuitionistic predicate logic theorem prover. Journal of Logic and Computation, 2:619-656, 1992.
25. S. SCHMITT ET. AL. JProver: Integrating connection-based theorem proving into interactive proof assistants. IJCAR-2001, LNAI 2083, pp. 421-426, Springer, 2001.
26. th CADE, LNAI 1104, pp. 2-16, Springer, 1996.
27. G. Sutcliffe, C. Suttner. The TPTP problem library - CNF release v1.2.1. Journal of Automated Reasoning, 21: 177-203, 1998. (http://www.cs.miami.edu/ ~tptp)
28. th CADE, LNAI 1104, pp. 2-16, Springer, 1996.
29. A. WAALER Connections in nonclassical logics. Handbook of Automated Reasoning, pp. 1487-1578, Elsevier, 2001.
30. L. WALLEN. Automated deduction in nonclassical logic. MIT Press, 1990.