Simultaneous Rigid Sorted Unification
In this paper we integrate a sorted unification calculus into free variable tableau methods for logics with term declarations. The calculus we define is used to close a tableau at once, unifying a set of equations derived from pairs of potentially complementary literals occurring in its branches. Apart from making the deduction system sound and complete, the calculus is terminating and so, it can be used as a decision procedure. In this sense we have separated the complexity of sorts from the undecidability of first order logic.
Unable to display preview. Download preview PDF.
- 2.A. G. Cohn. A many sorted logic with possibly empty sorts. CADE’11. LNCS 607, 633–647, 1992.Google Scholar
- 4.M. Fitting. First-Order Logic and Automated Theorem Proving (2 edition). Springer, 1996.Google Scholar
- 6.A. Gavilanes, J. Leach, P. J. Martín, S. Nieva. Reasoning with preorders and dynamic sorts using free variable tableaux. AISMC-3. LNCS 1138, 365–379, 1996.Google Scholar
- 7.A. Gavilanes, J. Leach, P. J. Martín, S. Nieva. Semantic tableaux for a logic with preorders and dynamic declarations. TABLEAUX’97 (Position paper), CRIN 97-R-030, 7–12, 1997.Google Scholar
- 8.O. Herzog et al. LILOG-Linguistic and logic methods for the computational understanding of german. LILOG-Report 1b, IBM Germany, 1986.Google Scholar
- 9.P. J. Martín, A. Gavilanes. Simultaneous sorted unification for free variable tableaux: an elegant calculus. TR-SIP 86/98. 1998.Google Scholar
- 10.P. J. Martín, A. Gavilanes, J. Leach. Free variable tableaux for a logic with term declarations. TABLEAUX’98. LNAI 1397, 202–216. 1998.Google Scholar
- 13.M. Schmidt-Schauss. Computational Aspects of an Order Sorted Logic with Term Declarations. LNAI 395, Springer, 1989.Google Scholar
- 14.C. Walther. A Many-sorted Calculus based on Resolution and Paramodulation. Research Notes in Artificial Intelligence. Pitman, 1987.Google Scholar
- 15.C. Weidenbach. A sorted logic using dynamic sorts. MPI-I-91-218, 1991.Google Scholar