Abstract
We study free variable tableau methods for logics with term declarations. We show how to define a substitutivity rule preserving the soundness of the tableaux and we prove that some other attempts lead to unsound systems. Based on this rule, we define a sound and complete free variable tableau system and we show how to restrict its application to close branches by defining a sorted unification calculus.
Research partially supported by the ESPRIT BR Working Group 6028 CCLII.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. G. Cohn. A more expressive formulation of many sorted logic. Journal of Automated Reasoning 3, 113–200, 1987.
M. Fitting. First-Order Logic and Automated Theorem Proving. Second edition. Springer, 1996.
A. M. Frisch. The substitutional framework for sorted deduction: fundamental results on hybrid reasoning. Artificial Intelligence 49, 161–198, 1991.
A. Gavilanes, J. Leach, P. J. Martín, S. Nieva. Reasoning with preorders and dynamic sorts using free variable tableaux. Proc. AISMC-3. LNCS 1138, 365–379, 1996.
A. Gavilanes, J. Leach, P. J. Martín, S. Nieva. Ground semantic tableaux for a logic with preorders and dynamic declarations. TR DIA 50/97. 1997.
A. Gavilanes, J. Leach, P. J. Martín. Free variable tableaux for a logic with term declarations. TR DIA 69/97. 1997.
E. Kogel. Rigid E-unification simplified. Proc. 4th International Workshop TABLEAUX’95. LNCS 918, 17–30, 1995.
M. Schmidt-Schauss. Computational Aspects of an Order Sorted Logic with Term Declarations. LNAI 395. Springer, 1989.
C. Walther. A Many-sorted Calculus based on Resolution and Paramodulation. Research Notes in Artificial Intelligence. Pitman, 1987.
C. Weidenbach. A sorted logic using dynamic sorts. MPI-I-91-218, 1991.
C. Weidenbach. First-order tableaux with sorts. J. of the Interest Group in Pure and Applied Logics 3(6), 887–907, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martín, P.J., Gavilanes, A., Leach, J. (1998). Free Variable Tableaux for a Logic with Term Declarations. In: de Swart, H. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1998. Lecture Notes in Computer Science(), vol 1397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69778-0_23
Download citation
DOI: https://doi.org/10.1007/3-540-69778-0_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64406-4
Online ISBN: 978-3-540-69778-7
eBook Packages: Springer Book Archive