A tableau-like representation framework for efficient proof reconstruction

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

Volumn 1847 LNAI, Issue , 2000, Pages 398-414

  Schmitt, Stephan ^a  

^a Center for Applied Mathematics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL LOGIC; MATRIX CHARACTERIZATIONS; NON-CLASSICAL LOGIC; PROOF RECONSTRUCTION;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BIOMINERALIZATION;

EID: 36849011409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722086_31     Document Type: Conference Paper

References (31)

1. P. B. Andrews. Transforming matings into natural deduction proofs. CADE-5, LNCS 87, pp. 281-292. Springer, 1980.
2. B. Beckert, J. Posegga. leanTAP : Lean tableau-based deduction. Journal of Automated Reasoning, 15(3):339-358, 1995.
3. W. Bibel. Automated theorem proving. Vieweg, Braunschweig, 1982.
4. W. Bibel, S. Brüning, U. Egly, T. Rath. Komet. CADE-12, LNAI 814, pp. 783-787. Springer, 1994.
5. W. Bibel, D. Korn, C. Kreitz, F. Kurucz, J. Otten, S. Schmitt, G. Stolpmann. A multi-level approach to program synthesis. 7th LOPSTR Workshop, LNAI 1463, pp. 1-25. Springer, 1998.
6. W. Bibel, D. Korn, C. Kreitz, S. Schmitt. Problem-oriented applications of automated theorem proving. DISCO-96, LNCS 1128, pp. 1-21. Springer, 1996.
7. R. Constable et. al. Implementing mathematics with the NuPRL proof development system. Prentice Hall, 1986.
8. B. I. Dahn et. al. Integrating logical functions with ILF. Preprint 94-10, Humboldt Universität zu Berlin, 1994.
9. H. Horacek. Presenting proofs in a human-oriented way. CADE-16, LNAI 1632, pp. 142-156. Springer, 1999.
10. X. Huang. Translating machine-generated resolution proofs into ND-proofs at the assertion level. 4th Pacific Rim International Conference on Artificial Intelligence, LNCS 1114, pp. 399-410. Springer, 1996.
11. M. C. Fitting. Proof methods for modal and intuitionistic logic. D. Reidel, 1983.
12. C. Kreitz, H. Mantel, J. Otten, S. Schmitt. Connection-based proof construction in linear logic. CADE-14, LNAI 1249, pp. 207-221. Springer, 1997.
13. C. Kreitz, J. Otten. Connection-based theorem proving in classical and nonclassical logics. Journal for Universal Computer Science, 5(3):88-112, 1999.
14. C. Kreitz, J. Otten, S. Schmitt. Guiding program development systems by a connection based proof strategy. 5th LOPSTR Workshop, LNCS 1048, pp. 137-151. Springer, 1996.
15. C. Kreitz, S. Schmitt. A uniform procedure for converting matrix proofs into sequent-style systems. Journal of Information and Computation, 2000 (to appear).
16. R. Letz, J. Schumann, S. Bayerl, W. Bibel. Setheo: A high-performance theorem prover. Journal of Automated Reasoning, 8:183-212, 1992.
17. C. Lingenfelder. Structuring computer generated proofs. IJCAI-89. Morgan Kaufmann, 1989.
18. H. Mantel, C. Kreitz. A matrix characterization for MELL. JELIA Workshop, LNCS 1489, pp. 169-183. Springer, 1998.
19. H. Mantel, J. Otten. linTAP: A tableau prover for linear logic. TABLEAUX Conference, LNAI 1617, pp. 217-231. Springer, 1999.
20. D. A. Miller. Expansion tree proofs and their conversion to natural deduction proofs. CADE-7, LNCS 170, pp. 375-393. Springer, 1984.
21. H. J. Ohlbach. A resolution calculus for modal logics. PhD Thesis, Univ. Kaiserslautern, 1988.
22. J. Otten. ileanTAP: An intuitionistic theorem prover. TABLEAUX Conference, LNAI 1227, pp. 307-386. Springer, 1997.
23. F. Pfenning. Analytic and non-analytic proofs. CADE-7, LNCS 170, pp. 394-413. Springer, 1984.
24. F. Pfenning. Proof transformations in higher-order logic. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, 1987.
25. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.
26. S. Schmitt. Proof reconstruction in classical and non-classical logics. PhD Thesis, TU-Darmstadt, 1999.
27. S. Schmitt, C. Kreitz. On transforming intuitionistic matrix proofs into standardsequent proofs. 4thTABLEAUX Workshop, LNAI 918, pp. 106-121. Springer, 1995.
28. S. Schmitt, C. Kreitz. Converting non-classical matrix proofs into sequent-style systems. CADE-13, LNAI 1104, pp. 418-432. Springer, 1996.
29. S. Schmitt, C. Kreitz. Deleting Redundancy in proof reconstruction. TABLEAUX Conference, LNAI 1397, pp. 262-276. Springer, 1998.
30. L. Wallen. Automated deduction in non-classical logics. MIT Press, 1990.
31. L. Wos et. al. Automated reasoning contributes to mathematics and logic. CADE-10, LNCS 449, p. 485-499. Springer, 1990.