A uniform proof procedure for classical and non-classical logics

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

Volumn 1137, Issue , 1996, Pages 307-319

  Otten, Jens ^a   Kreitz, Christoph ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION;

CLASSICAL LOGIC; CONNECTION METHOD; MATRIX CHARACTERIZATIONS; NON-CLASSICAL LOGIC; PATH-CHECKING; PROOF PROCEDURES; PROOF SEARCH; UNIFICATION ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 84958549688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61708-6_70     Document Type: Conference Paper

References (17)

1. B. Beckert AND J. Posegga. lesnTAP: lean, tableau-based theorem proving. Proc. CADE-12, LNAI 814, 1994.
2. E. W. Beth. The foundations of mathematics. North-Holland, 1959.
3. W. Bebel, S. Brüning, U. Egly, T. Rath. Komet. Proc. CADE-12, LNAI 814, pp. 783-787. 1994.
4. W. Bebel. On matrices with connections. Jour, of the ACM, 28, p. 633-645, 1981.
5. W. Bebel. Automated Theorem Proving. Vieweg, 1987.
6. M. C. Fitting. Intuitionistic logic, model theory and forcing. North-Holland, 1969.
7. G. Gentzen. Untersuchungen iiber das logische Schließen. Mathematische Zeit-schrift, 39:176-210, 405-431, 1935.
8. R. Letz, J. Schumann, S. Bayerl, W. Bibel. Setheo: A high-performance theorem prover. Journal of Automated Reasoning, 8:183-212, 1992.
9. A. Martelli and TJgo Montanari. An efficient unification algorithm. ACM TO- PLAS, 4:258-282, 1982.
10. H. J. OHLBACH. A resolution calculus for modal logics. Ph.D. Thesis, Universität Kaiserslautern, 1988.
11. J. Otten, C. Kreitz. A connection based proof method for intuitionistic logic. Proc. 4th TABLEAUX Workshop, LNAI 918, pp. 122-137, 1995.
12. J. Otten, C. Kreitz. T-String-Unification: Unifying Prefixes in Non-Classical Proof Methods. Proc. 5th TABLEAUX Workshop, LNAI 1071, pp. 244-260, 1996.
13. J. Otten. Ein konnektionenorientiertes Beweisverfahren für intuitionistische Logik. Master’s thesis, TH Darmstadt, 1995.
14. J. A. Robinson. A machine-oriented logic based on the resolution principle. Jour, of the ACM, 12(1):23-41, 1965.
15. L. Wallen. Matrix proof methods for modal logics. JJCAI-87, p. 917-923. 1987.
16. L. WALLEN. Automated deduction in nonclassical logic. MIT Press, 1990.
17. L. Wos ET. AL. Automated reasoning contributes to mathematics and logic. Proc. CADE-10, LNCS 449, pp. 485-499, 1990.