Skip to main content
Springer Nature Link
Log in

Unification in a combination of arbitrary disjoint equational theories

  • Conference paper
  • First Online:
9th International Conference on Automated Deduction (CADE 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 310))

Included in the following conference series:

  • 170 Accesses

Abstract

The unification problem for terms in a disjoint combination E 1 +... +E n of arbitrary theories is reduced to a combination of pure unification problems in E j, where free constants may occur in terms, and to constant elimination problems like: find all substitutions σ such that (the free constant) ci no longer occurs in the term σt (modulo E j), where t is a term in the theory E j.

The algorithm consists of the following basic steps: First of all the terms to be unified are transformed via variable abstraction into pure terms belonging to one particular theory. Terms belonging to the same theory can now be unified with the algorithm for this theory. For terms in some multi-equation belonging to different theories it is sufficient to select some theory and collapse all terms not belonging to this particular theory into a common constant. Finally constant elimination must be applied in order to solve cyclic unification problems like 〈x=f(y), y=g(x)〉.

The algorithm shows that a combination of finitary unifying regular theories, of Boolean rings, of Abelian groups or of BNT-theories (basic narrowing terminates) is of unification-type finitary, since these theories have finitary constant-elimination problems. As a special case, unification in a combination of a free Boolean ring with free function symbols is decidable and finitary; the same holds for free Abelian groups. Remarkably, it can be shown that unification problems can be solved in the general case E 1 +... +E n if for every i there is a method to solve unification problems in a combination of E i with free function symbols. Thus, unification in a combination with free function symbols is the really hard case.

This paper presents solutions to the important open questions of combining unification algorithms in a disjoint combination of theories. As a special case it provides a solution to the unification of general terms (i.e. terms, where free function symbols are permitted) in free Abelian groups and Boolean rings. It extends the known results on unification in a combination of regular and collapse-free theories in two aspects: Arbitrary theories are admissable and we can use complete unification procedures (including universal unification procedures such as narrowing) that may produce an infinite complete set of unifiers for a special theory.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bürckert, H.-J., Herold A., Schmidt-Schauß, M., On Equational Theories, Unification and Decidability, LNCS 256, pp. 204–215. (Also to appear in JSC, special issue on unification)

    Google Scholar 

  2. Bürckert, H.-J., Some relationships between Unification, Restricted Unification and Matching, in Proc. of 8th CADE, Springer, LNCS 230, pp. 514–524, (1986)

    Google Scholar 

  3. Bürckert, H.-J., Matching — A special case of unification?, Technical report, SR-87-08

    Google Scholar 

  4. Büttner, W., Simonis, H., Embedding Boolean Expressions in Logic Programming, preprint, Siemens AG, München, (1986)

    Google Scholar 

  5. Colmerauer, A., Equations and inequations on finite and infinite trees, Proc. of the int. Conf. on FGCS, (ed. ICOT), (1984)

    Google Scholar 

  6. Chang, C., Lee, R. C., Symbolic Logic and Mechanical Theorem Proving, Academic Press, (1973)

    Google Scholar 

  7. Crone-Rawe, Bernhard, ‘Unification algorithms for Boolean rings', Diplom-arbeit, Universität Kaiserslautern, (to appear)

    Google Scholar 

  8. Fay, M., ‘First Order Unification in an Equational Theory', Proc. 4th CADE, Texas, pp. 161–167, (1979)

    Google Scholar 

  9. Fages, F., Associative-Commutative Unification, Proc. of 7th CADE (ed. Shostak, R.E.), LNCS 170, pp. 194–208, (1984)

    Google Scholar 

  10. Fages, F., Associative-Commutative Unification, Technical report, INRIA, (1985)

    Google Scholar 

  11. Fages, F., Huet G., Complete sets of unifiers and matchers in equational theories. Proc. CAAP-83, LNCS 159, (1983). Also in Theoretical Computer Science 43, pp. 189–200, (1986)

    Google Scholar 

  12. Gallier, J. H., Logic for Computer Science, Harper & Row, (1986)

    Google Scholar 

  13. Grätzer, G. Universal Algebra, Springer-Verlag, (1979)

    Google Scholar 

  14. Herold, A., ‘Combination of Unification Algorithms', Proc. 8th CADE, ed. J. Siekmann, LNCS 230, pp. 450–469, (1986). Also: MEMO-SEKI 86-VIII-KL, Universität Kaiserslautern, 1985

    Google Scholar 

  15. Herold, A., Siekmann, J., Unification in Abelian Semigroups, JAR 3 (3), pp. 247–283, (1987)

    Google Scholar 

  16. Huet, G., Oppen, D.C., Equations and Rewrite Rules, SRI Technical Report CSL-111, (1980) also in:Formal Languages: Perspectives and open problems, R. Book.(ed), Academic Press, (1982)

    Google Scholar 

  17. Huet, G. Résolution d'Équations dans des langages d'ordre 1,2,...,ω, Thèse d'État, Univ. de Paris VII, (1976)

    Google Scholar 

  18. Huet, G. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, JACM 27, 4, pp. 797–821, (1980)

    Article  Google Scholar 

  19. Hullot, J.-M., Canonical Forms and Unification, Proc. 5th CADE, LNCS 87, pp.318–334, (1980)

    Google Scholar 

  20. Jouannaud, J.-P., Kirchner, C., Kirchner, H., ‘Incremental Construction of Unification Algorithms in Equational Theories', Proc. of 10th ICALP ed J.Diaz, LNCS 154, pp. 361–373, (1983)

    Google Scholar 

  21. Kirchner, C., A New Equational Unification Method: A generalization of Martelli-Montanari's Algorithm. 7th CADE, LNCS 170, pp. 224–247, (1984)

    Google Scholar 

  22. Kirchner, C.,: ‘Computing Unification Algorithms', Conf. on Logic in Computer Science, pp. 206–216, (1986)

    Google Scholar 

  23. Kirchner, C., Methods and Tools for Equational Unification, CNRS technical report Nr. 87-R-008, University of Nancy I, (1987)

    Google Scholar 

  24. Knuth, D.E., Bendix, P.B., ‘Simple Word Problems in Universal Algebras', in: Computational Problems in Abstract Algebra, J. Leech ed., Pergamon Press, Oxford, (1970)

    Google Scholar 

  25. Lankford, D., Butler, D., Brady, B., Abelian group unification algorithms for elementary terms., Contemporary Math. 29, pp. 193–199, (1984)

    Google Scholar 

  26. Lankford D.S., Ballantyne A.M., Decision procedures for simple equational theories with commutative-associative axioms: complete sets of commutative-associative reductions. Report ATP-39, Dept. of Mathematics, Universoty of Texas, Austin, Texas, (1977)

    Google Scholar 

  27. Livesey, M., Siekmann, J., Unification of Sets and Multisets, SEKI technical report, Universität Karslruhe, (1978)

    Google Scholar 

  28. Martelli, A., and Montanari, U., An Efficient Unification Algorithm, ACM Trans. Programming Languages and Systems 4, 2, pp. 258–282, (1982)

    Article  Google Scholar 

  29. Martin, U., Unification in Boloean rings and unquantified formluae of the first order predicate calculus, (to appear in JAR)

    Google Scholar 

  30. Martin, U., Nipkov, T., Unification in Boolean Rings,Proc. 8th CADE, LNCS 230, pp. 506–513, (1986)

    Google Scholar 

  31. Nutt, W., Réty, P., Smolka, G., Basic Narrowing Revisited, Technical report SR-87-07, Universität Kaiserslautern, (1987)

    Google Scholar 

  32. Peterson, G.E., Stickel M.E., Complete sets of reductions for some equational theories, JACM 28,2, pp. 233–264, (1981)

    Article  Google Scholar 

  33. Plotkin, G., Building in equational theories, Machine Intelligence 7, pp.73–90, (1972)

    Google Scholar 

  34. Robinson. J.A. A machine-Oriented Logic Based on the resolution principle. JACM 12,1 pp.23–41, (1965)

    Article  Google Scholar 

  35. Schmidt-Schauss, M., Unification under Associativity and Idempotence is of Type Nullary, JAR 2,3, pp. 277–281, (1986)

    Google Scholar 

  36. Schmidt-Schauss, M., Computational aspects of an order-sorted logic with term declarations, thesis, (1987), (to appear)

    Google Scholar 

  37. Schmidt-Schauss, M., Unification in a Combination of Arbitrary Disjoint Equational Theories, SEKI report SR-87-16, Universität Kaiserslautern, (1987)

    Google Scholar 

  38. Shostak, R.E., Deciding Combinations of Theories, JACM 31, pp. 1–12, (1984)

    Article  Google Scholar 

  39. Siekmann, J., Stringunification, Essex university, Memo CSM-7, (1975)

    Google Scholar 

  40. Siekmann, J.H., Unification Theory, Proc. of ECAT86, Vol II, p. vi–xxxv, Brighton, (1986)

    Google Scholar 

  41. Siekmann, J.H., Unification Theory, Journal of Symbolic Computation, (to appear)

    Google Scholar 

  42. Stickel, M., ‘A unification algorithm for associative-commutative functions', Journal of the ACM 28 (3), pp. 423–434 (1981)

    Article  Google Scholar 

  43. Stickel, M., ‘A comparison of the variable-abstraction and constant-abstraction method for associative-commutative unification', JAR 3, pp. 285–289, (1987)

    Google Scholar 

  44. Szabo, P., Theory of first order unification, (in German), Thesis, University of Karlsruhe, (1982)

    Google Scholar 

  45. Tidén, E., First-Order Unification in Combinations of Equational Theories, Thesis, Stockholm, (1986)

    Google Scholar 

  46. Tidén, E.: ‘Unification in Combination of Collapse Free Theories with Disjoint Sets of Function Symbols', Proc. 8th CADE, LNCS 230, pp. 431–449, (1986)

    Google Scholar 

  47. Yelick, K.A. Unification in Combinations of Collapse-free Regular Theories. J. of Symbolic Computation 3, pp. 153–181, (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Kaiserslautern, Postfach 3049, West Germany

    Manfred Schmidt-Schauß

Authors
  1. Manfred Schmidt-Schauß
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ewing Lusk Ross Overbeek

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmidt-Schauß, M. (1988). Unification in a combination of arbitrary disjoint equational theories. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012845

Download citation

  • DOI: https://doi.org/10.1007/BFb0012845

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19343-2

  • Online ISBN: 978-3-540-39216-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics