Abstract
This paper provides two results concerning Order-Sorted Logic with Term Declarations. First, we show that linear term declarations can be transformed conservatively into function declarations, thus yielding elementary signatures. This provides a simple proof of the well known fact that unification in linear signatures is decidable. A similar transformation exists for semi-linear term declarations, resulting in shallow term declarations. Secondly, we provide an inference system transforming sort constraints over an arbitrary signature into almost solved form. The step from almost solved forms to solved forms requires a procedure to decide emptiness of sort intersections, which is not possible in general. This shows that it is the sort intersection problem that accounts for the undecidability of unification in signatures with term declarations.
This research was funded by the German Ministery for Research and Technology (BMFT) under grant ITS 9103.
Preview
Unable to display preview. Download preview PDF.
References
Bachmair, L., H. Ganzinger and U. Waldmann. Set Constraints are the Monadic Class. Technical Report MPI-I-92-240, Saarbrücken, Germany 1992.
Comon, H. and C. Delor. Equational Formulae With Membership Constraints. Rapport de Recherche 649, LRI, Universite de Paris Sud, Orsay, France 1991.
Schmidt-Schauß, M. Computational Aspects of an Order-Sorted Logic With Term Declarations. Springer LNAI 395, New York 1989.
Uribe, T. E. Sorted Unification Using Set Constraints. In: D. Kapur (Ed.). Proc. of 11th Int. Conf. on Automated Deduction, Saratoga Springs, NY (1992). Springer LNAI 609, 163–177.
Uribe, T. E. Sorted Unification and the solution of semi-linear membership constraints. Technical Report UIUCDCS-R-91-1720, University of Illinois, Urbana, Illinois, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Socher-Ambrosius, R. (1993). Unification in Order-Sorted Logic with Term Declarations. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_62
Download citation
DOI: https://doi.org/10.1007/3-540-56944-8_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56944-2
Online ISBN: 978-3-540-47830-0
eBook Packages: Springer Book Archive