Skip to main content
SpringerLink
Log in

DCTP 1.2 — System Abstract

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2002)

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

Abstract

We describe version 1.2 of the theorem prover DCTP, which is an implementation of the disconnection calculus. The disconnection calculus is a confluent tableau method using non-rigid variables. This current version of DCTP has been extended and enhanced significantly since its participation in the IJCAR system competition in 2001. We briefly sketch the underlying calculus and the proof procedure and describe some of its refinements and new features. We also present the results of some experiments regarding these new features.

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. P. Baumgartner, N. Eisinger, and U. Furbach. A confluent connection calculus. In Harald Ganzinger, editor, Proc. CADE-16, Trento, Italy, LNAI 1632, pages 329–343. Springer, 1999.

    Google Scholar 

  2. P. Baumgartner, U. Furbach, and I. Niemelä. Hyper tableaux. In José Júlio Alferes et al., editors, Proc. JELIA-96: Logics in Artificial Intelligence, LNAI 1126, pp. 1–17, Berlin, 1996. Springer.

    Google Scholar 

  3. Jean-Paul Billon. The disconnection method: a confluent integration of unification in the analytic framework. In P. Migliolo et al., editors, Proc. 5th Tableaux Workshop, LNAI 1071, pp. 110–126, Berlin, 1996. Springer.

    Google Scholar 

  4. S.-J. Lee and D. Plaisted. Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning, pp. 25–42, 1992.

    Google Scholar 

  5. Reinhold Letz, Johann Schumann, Stephan Bayerl, and Wolfgang Bibel. SETHEO: A high-performance theorem prover. Journal of Automated Reasoning, 8(2):183–212, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  6. Reinhold Letz and Gernot Stenz. DCTP: A Disconnection Calculus Theorem Prover. In Rajeev Goré, Alexander Leitsch, and Tobias Nipkow, editors, Proc. IJCAR-2001, Siena, Italy, LNAI 2083, pp. 381–385. Springer, Berlin, 2001.

    Google Scholar 

  7. Reinhold Letz and Gernot Stenz. Proof and Model Generation with Disconnection Tableaux. In Andrei Voronkov, editor, Proc. LPAR 2001, Havanna, Cuba, pp. 142–156. Springer, Berlin, 2001.

    Google Scholar 

  8. F. Oppacher and E. Suen. HARP: A tableau-based theorem prover. Journal of Automated Reasoning, 4:69–100, 1988.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, D-80290, Munich, Germany

    Gernot Stenz

Authors
  1. Gernot Stenz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Abteilung Wisssenbasierte Systeme 184/3, Technische Univesität Wien, Favoritenstr. 9-11, 1040, Vienna, Austria

    Uwe Egly

  2. Institut für Computersprachen AG Theoretische Informatik und Logik 185.2, Technische Universität Wien, Favoritenstr. 9-11, 1040, Vienna, Austria

    Chritian G. Fermüller

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stenz, G. (2002). DCTP 1.2 — System Abstract. In: Egly, U., Fermüller, C.G. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2002. Lecture Notes in Computer Science(), vol 2381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45616-3_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-45616-3_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43929-5

  • Online ISBN: 978-3-540-45616-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation