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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
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.
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.
S.-J. Lee and D. Plaisted. Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning, pp. 25–42, 1992.
Reinhold Letz, Johann Schumann, Stephan Bayerl, and Wolfgang Bibel. SETHEO: A high-performance theorem prover. Journal of Automated Reasoning, 8(2):183–212, 1992.
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.
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.
F. Oppacher and E. Suen. HARP: A tableau-based theorem prover. Journal of Automated Reasoning, 4:69–100, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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