Abstract
One kind of flexibility of a theorem prover can be sought in the possibility to specify the inference rules used. Starting from the analysis of three different calculi a description language is presented which can be used for this purpose. The description of the analyzed calculi is shown and a PTTP-like translation style is sketched.
This work has partially been funded by the Deutsche Forschungsgemeinschaft.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Peter Baumgartner and Ulrich Furbach. Model elimination without contrapositives. In Alan Bundy, editor, CADE-12, volume LNCS 814, pages 87–101. Springer Verlag, 1994.
Gérard Becher and Uwe Petermann. Rigid E-unification by completion and rigid paramodulation. In Bernhard Nebel and Leonie Dreschler-Fischer, editors, KI-94: Advances in Artificial Intelligence, volume LNAI 861, pages 319–330. Springer Verlag, 1994.
Bernhardt Beckert. A completion-based method for mixed universal and rigid E-unification. In Alan Bundy, editor, CADE-12, volume LNCS 814, pages 678–692. Springer Verlag, 1994.
Wolfgang Bibel. Automated Theorem Proving. Vieweg Verlag, 1987.
D. Brand. Proving theorems with the modification method. SIAM Journal of Computation, 4:412–430, 1975.
Thierry Boy de la Tour. Minimizing the number of clauses by renaming. In Mark E. Stickel, editor, CADE-10, volume LNCS 449, pages 558–572. Springer Verlag, July 1990.
J. Gallier, P. Narendran, D. Plaisted, and W. Snyder. Theorem proving with equational matings and rigid E-unification. Journal of the ACM, 1992.
Jean Goubault. A rule-based algorithm for rigid E-unification. In Georg Gottlob, Alexander Leitsch, and Daniele Mundici, editors, 3rd Kurt Gödel Colloquium '93, volume 713 of LNCS. Springer Verlag, 1993.
Xiaorong Huang, Manfred Kerber, Michael Kohlhase, et al. KEIM: A toolkit for automated deduction. In Alan Bundy, editor, CADE-12, volume LNAI 814, pages 807–810. Springer Verlag, 1994.
Gerd Neugebauer and Torsten Schaub. A pool-based connection calculus. In C. Bozşahin, U. Halici, K. Oflazar, and N. Yalabik, editors, Proceedings of Third Turkish Symposium on Artificial Intelligence and Neural Networks, pages 297–306. Middle East Technical University Press, 1994.
Uwe Petermann. Completeness of the pool calculus with an open built in theory. In Georg Gottlob, Alexander Leitsch, and Daniele Mundici, editors, 3rd Kurt Gödel Colloquium '93, volume LNCS 713. Springer Verlag, 1993.
Uwe Petermann. A theory connection calculus with positive refinement. NTZ-Report 25/93, NTZ der Universität Leipzig, 1993.
Uwe Petermann. A complete connection calculus with rigid Eunification. In JELIA94, volume LNCS 838, pages 152–167. Springer Verlag, 1994.
David A. Plaisted. A sequent-style model elimination strategy and a positive refinement. J. Automated Reasoning, 6:389–402, 1990.
Jörg H. Siekmann. Unification theory. J. Symbolic Computation, 7(1):207–274, January 1989.
M.E. Stickel. Automated deduction by theory resolution. J. Automated Reasoning, 4(1):333–356, 1985.
Mark E. Stickel. A Prolog Technology Theorem Prover: Implementation by an extended Prolog compiler. J. Automated Reasoning, 4:353–380, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neugebauer, G., Petermann, U. (1995). Specifications of inference rules and their automatic translation. In: Baumgartner, P., Hähnle, R., Possega, J. (eds) Theorem Proving with Analytic Tableaux and Related Methods. TABLEAUX 1995. Lecture Notes in Computer Science, vol 918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59338-1_36
Download citation
DOI: https://doi.org/10.1007/3-540-59338-1_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59338-6
Online ISBN: 978-3-540-49235-1
eBook Packages: Springer Book Archive