Abstract
In the literature unification is often treated as a simple and straightforward matter, even though it is recognized as a deep and fundamental concept. However when a thorough presentation is attempted, it is then realized that the matter is fairly subtle and treacherous. For instance the notion of most general unifier and its property of being unique up to renaming are open to different interpretations. In fact there are several approaches to unification, based on different mathematical concepts, which are not equivalent. We present here the alternatives and clarify their relationships. In the process new results are obtained related to the notions of equation solving, most specific generalization and constraint solving. This leads to a comprehensive presentation of an elementary theory of unification.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chang, C.L. and Lee, R. [1973] Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.
Colmerauer, A. [1984] Equations and Inequations on Finite and Infinite Trees, FGCS'84 Proceedings, Nov. 1984, 85–99.
Eder, E. [1985] Properties of Substitutions and Unifications, Journal of Symbolic Computation, 1985, 1, 31–46.
Herbrand, J. [1930] Recherches sur la theorie de la demonstration (These), Universite de Paris. (In: Ecrits logiques de Jacques Herbrand, Paris, PUF, 1968).
Huet, G. [1976] Resolution d'Equations Dans Des Langages D'Ordre, 1, 2,...,ω (These d'Etat), Universite de Paris VII, Dec. 1976.
Huet, G. and Oppen, D.C. [1980] Equations and Rewrite Rules: A Survey, Formal Languages: Perspectives and Open Problems, (R. Book Ed.), Academic Press, 1980.
Jaffar, J. and Lassez, J-L. [1987] Constraint Logic Programming, Proc. POPL'87, January 1987, 111–119.
Kirchner, C. and Lescanne, P. [1987] Solving Disequations, Proc. Logic in Computer Science Conf., to appear.
Kunen, K. [1987a] Negation in Logic Programming, Journal of Logic Programming, to appear.
Kunen, K. [1987b] Answer Sets and Negation as Failure, Proc. ICLP 4, MIT Press, May 1987, 219–228.
Lassez, J-L. and Marriott, K.G. [1986] Explicit Representation of Terms Defined by Counter Examples, Proc. FST & TCS Conference, LNCS 241, December 1986. Full version to appear in Journal of Automated Reasoning.
Lloyd, J.W. [1984] Foundations of Logic Programming, Springer-Verlag, 1984.
Maher, M.J. [1987] Logic Semantics for a Class of Committed-choice Programs, Proc. ICLP 4, MIT Press, May 1987, 858–876.
Makowsky, J. [1984] Model Theoretic Issues in Theoretical Computer Science Part 1: Relational Databases and Abstract Data Types, Logic Colloquium 82, (G. Lolli, G. Longo & A. Marcja Eds.), Elsevier, 1984.
Martelli, A. and Montanari, U. [1982] An Efficient Unification Algorithm, TOPLAS, Vol. 4, No. 2, April 1982, 258–282.
Manna, Z. and Waldinger, R. [1980] Problematic Features of Programming Languages: a Situational-calculus Approach, Report No. STAN-CS-80-779, Stanford University, 1980.
Manna, Z. and Waldinger, R. [1981] Deductive Synthesis of the Unification Algorithm, Science of Computer Programming, Vol 1, 5–48, 1981.
Naish, L. [1986] Negation & Quantifiers in NU-Prolog, Proc. 3rd Conf. on Logic Programming, LNCS 225, 624–634, July 1986.
Paterson, M. and Wegman, M. [1978] Linear Unification, Journal of Computer and System Sciences, Vol 16, No 2, 1978, 158–167.
Plotkin, G. [1970] A Note on Inductive Generalization, Machine Intelligence 5, (B. Meltzer & D. Michie Eds.), 1970 153–163.
Plotkin, G. [1971] A Further Note on Inductive Generalization, Machine Intellgence 6, (B. Meltzer & D. Michie Eds.), 1971, 101–124.
Reynolds, J. [1970] Transformational Systems and the Algebraic Structure of Atomic Formulas, Machine Intelligence 5, (B. Meltzer & D. Michie Eds.), 1970, 135–152.
Robinson, J.A. [1965] A Machine-Oriented Logic Based on the Resolution Principle, JACM, Vol. 12, No. 1, Jan. 1965, 23–41.
Robinson, J.A. [1979] Logic: Form and Function — The Mechanization of Deductive Reasoning, North-Holland, New York, 1979.
Sato, T. [1986] Declarative Logic Programming, Research Memo, Electrotechnical Laboratory, 1986.
Sterling, L. and Shapiro, E.Y. [1986] The Art of PROLOG, MIT Press, 1986.
Vere, S.A. [1975] Induction of Concepts in the Predicate Calculus, IJCAI-75, 1975, 281–287.
Vere, S.A. [1977] Induction of Relational Productions in the Presence of Background Information, IJCAI-77, 1977, 349–355.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lassez, J.L., Maher, M.J., Marriott, K. (1988). Unification revisited. In: Boscarol, M., Carlucci Aiello, L., Levi, G. (eds) Foundations of Logic and Functional Programming. Lecture Notes in Computer Science, vol 306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19129-1_4
Download citation
DOI: https://doi.org/10.1007/3-540-19129-1_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19129-2
Online ISBN: 978-3-540-39126-5
eBook Packages: Springer Book Archive