Skip to main content
SpringerLink
Log in

A Tableau-Like Representation Framework for Efficient Proof Reconstruction

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1847))

Abstract

We present a tableau-like framework, so-called β-proofs, for a uniform representation of analytic tableaux or matrix proofs. β-proofs suggest split structures for sequent proofs but still violate non-permutabilities of sequent rules. Two operations on β-proofs stepwisely solve these violations while removing all redundant inference steps from the β-proofs. This process provides a general basis for a search-free reconstruction of sequent proofs, independent from concrete proof calculi. Our framework is is uniformly applicable to classical logic and to all the non-classical logics that have a matrix characterization of validity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, P.B.: Transforming matings into natural deduction proofs. In: Bibel, W. (ed.) CADE 1980. LNCS, vol. 87, pp. 281–292. Springer, Heidelberg (1980)

    Google Scholar 

  2. Beckert, B., Posegga, J.: leanTAP: Lean tableau-based deduction. Journal of Automated Reasoning 15(3), 339–358 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bibel, W.: Automated theorem proving, Vieweg, Braunschweig (1982)

    Google Scholar 

  4. Bibel, W., Brüning, S., Egly, U., Rath, T.: Komet. In: Bundy, A. (ed.) CADE 1994. LNCS (LNAI), vol. 814, pp. 783–787. Springer, Heidelberg (1994)

    Google Scholar 

  5. Bibel, W., Korn, D., Kreitz, C., Kurucz, F., Otten, J., Schmitt, S., Stolpmann, G.: A multi-level approach to program synthesis. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS (LNAI), vol. 1463, pp. 1–25. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Bibel, W., Korn, D., Kreitz, C., Schmitt, S.: Problem-oriented applications of automated theorem proving. In: Limongelli, C., Calmet, J. (eds.) DISCO 1996. LNCS, vol. 1128, pp. 1–21. Springer, Heidelberg (1996)

    Google Scholar 

  7. Constable, R., et al.: Implementing mathematics with the NuPRL proof development system. Prentice Hall, Englewood Cliffs (1986)

    Google Scholar 

  8. Dahn, B.I., et al.: Integrating logical functions with ILF. Preprint 94-10, Humboldt Universität zu Berlin (1994)

    Google Scholar 

  9. Horacek, H.: Presenting proofs in a human-oriented way. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 142–156. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Huang, X.: Translating machine-generated resolution proofs into ND-proofs at the assertion level. In: Foo, N.Y., Göbel, R. (eds.) PRICAI 1996. LNCS, vol. 1114, pp. 399–410. Springer, Heidelberg (1996)

    Google Scholar 

  11. Fitting, M.C.: Proof methods for modal and intuitionistic logic. D. Reidel, Dordrechtz (1983)

    Google Scholar 

  12. Kreitz, C., Mantel, H., Otten, J., Schmitt, S.: Connection-based proof construction in linear logic. In: McCune, W. (ed.) CADE 1997. LNCS (LNAI), vol. 1249, pp. 207–221. Springer, Heidelberg (1997)

    Google Scholar 

  13. Kreitz, C., Otten, J.: Connection-based theorem proving in classical and nonclassical logics. Journal for Universal Computer Science 5(3), 88–112 (1999)

    MATH  MathSciNet  Google Scholar 

  14. Kreitz, C., Otten, J., Schmitt, S.: Guiding program development systems by a connection based proof strategy. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol. 1048, pp. 137–151. Springer, Heidelberg (1996)

    Google Scholar 

  15. Kreitz, C., Schmitt, S.: A uniform procedure for converting matrix proofs into sequent-style systems. Journal of Information and Computation (2000) (to appear)

    Google Scholar 

  16. Letz, R., Schumann, J., Bayerl, S., Bibel, W.: Setheo: A high-performance theorem prover. Journal of Automated Reasoning 8, 183–212 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lingenfelder, C.: Structuring computer generated proofs. In: IJCAI 1989. Morgan Kaufmann, San Francisco (1989)

    Google Scholar 

  18. Mantel, H., Kreitz, C.: A matrix characterization for MELL. In: Dix, J., Fariñas del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol. 1489, pp. 169–183. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  19. Mantel, H., Otten, J.: linTAP: A tableau prover for linear logic. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol. 1617, pp. 217–231. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. Miller, D.A.: Expansion tree proofs and their conversion to natural deduction proofs. In: Shostak, R.E. (ed.) CADE 1984. LNCS, vol. 170, pp. 375–393. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  21. Ohlbach, H.J.: A resolution calculus for modal logics. PhD Thesis, Univ. Kaiserslautern (1988)

    Google Scholar 

  22. Otten, J.: ileanTAP: An intuitionistic theorem prover. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS (LNAI), vol. 1227, pp. 307–386. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  23. Pfenning, F.: Analytic and non-analytic proofs. In: Shostak, R.E. (ed.) CADE 1984. LNCS, vol. 170, pp. 394–413. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  24. Pfenning, F.: Proof transformations in higher-order logic. Ph.D. Thesis. Carnegie Mellon University, Pittsburgh (1987)

    Google Scholar 

  25. Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM 12(1), 23–41 (1965)

    Article  MATH  Google Scholar 

  26. Schmitt, S.: Proof reconstruction in classical and non-classical logics. PhD Thesis, TU-Darmstadt (1999)

    Google Scholar 

  27. Schmitt, S., Kreitz, C.: On transforming intuitionistic matrix proofs into standardsequent proofs. In: Baumgartner, P., Posegga, J., Hähnle, R. (eds.) TABLEAUX 1995. LNCS (LNAI), vol. 918, pp. 106–121. Springer, Heidelberg (1995)

    Google Scholar 

  28. Schmitt, S., Kreitz, C.: Converting non-classical matrix proofs into sequent-style systems. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS (LNAI), vol. 1104, pp. 418–432. Springer, Heidelberg (1996)

    Google Scholar 

  29. Schmitt, S., Kreitz, C.: Deleting Redundancy in proof reconstruction. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 262–276. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  30. Wallen, L.: Automated deduction in non-classical logics. MIT Press, Cambridge (1990)

    Google Scholar 

  31. Wos, L., et al.: Automated reasoning contributes to mathematics and logic. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 485–499. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, Ithaca, NY, 14853, USA

    Stephan Schmitt

Authors
  1. Stephan Schmitt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of St Andrews, Scotland

    Roy Dyckhoff

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmitt, S. (2000). A Tableau-Like Representation Framework for Efficient Proof Reconstruction. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_31

Download citation

  • DOI: https://doi.org/10.1007/10722086_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67697-3

  • Online ISBN: 978-3-540-45008-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation