Abstract
This paper extends a calculus for first-order logic that combines the inference mechanism of hyperresolution with the more informative structure of analytic tableaux and that has been introduced as hyper tableaux by Baumgartner et al. (1996). This clausal tableau calculus is proof confluent, but suffers from the need of partial ground instantiations.
I will develop an improvement of hyper tableaux which avoids this by using full unification with rigid variables, but keeps desirable features like proof confluence and a partially universal treatment of variables in a clausal tableau. The resulting calculus can be seen as a refined hyper resolution calculus that deals properly with an arbitrary literal selection function without loss of completeness.
For this calculus, I have implemented and evaluated a proof procedure which takes advantage of proof confluence and addresses the fairness problem of tableau caluli with a redundancy criterion based upon literal subsumption.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Baumgartner Theory Reasoning in Connection Calculi and the Linearizing Completion Approach. PhD thesis, Universität Koblenz-Landau, 1996.
P. Baumgartner, U. Furbach, and 1. Niemeki. Hyper Tableaux. In Proc. JELIA '96, volume 1126 of LNAI Springer, 1996.
J.-P. Billon. The Disconnection Method. In P. Moscato, U. Moscato, D. Mundici, and M. Ornaghi, editors, Proc. TABLEAUX '96, volume 1071 of LNAI Springer, 1996.
C. Chang and R. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.
M. Fitting. First-Order Logic and Automated Theorem Proving. Springer-Verlag, 1990.
S.-J. Lee and D. Plaisted. Eliminating Duplicates with the Hyper-Linking Strategy. Journal of Automated Reasoning, 9:25–42, 1992.
R. Letz, K. Mayr, and C. Goner. Controlled Integrations of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13, 1994.
W. McCune. Otter 2.0 Users Guide. Technical Report ANL-90/9, Argonne National Laboratory, 1990.
F. Oppacher and E. Suen. HARP: A Tableau-Based Theorem Prover. Journal of Automated Reasoning, 4:69–100, 1988.
J. A. Robinson. Automated deduction with hyper-resolution. Internat. J. Comput. Math., 1:227–234, 1965.
J. R. Slagle. Automatic theorem proving with renamable and semantic resolution. J. ACM, 17(3):535–542, 1967.
G. Sutcliffe, C. Sonnet, and T. Yemenis. The TPTP problem library. In A. Bundy, editor, Proc. CADE-12, volume 814 of LNAI Springer, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kühn, M. (1997). Rigid hypertableaux. In: Brewka, G., Habel, C., Nebel, B. (eds) KI-97: Advances in Artificial Intelligence. KI 1997. Lecture Notes in Computer Science, vol 1303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540634932_6
Download citation
DOI: https://doi.org/10.1007/3540634932_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63493-5
Online ISBN: 978-3-540-69582-0
eBook Packages: Springer Book Archive