Abstract
A unifier is a substitution that makes two terms syntactically equal. In this paper, we discuss a more semantical unifier: an equational unifier, which is a substitution that makes two terms equal modulo a congruence relation. As a result we will give a general procedure that enumerates a complete set of equational unifiers for a given pair of terms under a given congruence.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bachmair, L., Dershowitz, N., and Hsiang, J.: Ordering for equational proof, Proc. Symp. Logic in Computer Science, Cambridge, Massachusetts (June 1986)
Bachmair, L., Dershowitz, N., and Plaisted, D. A.: Completion without failure, Proc. Colloquium on Resolution of Equations in Algebraic Structures (1987)
Bosco, P. G., Giovannetti, F., and Moiso, C.: Refined strategies for equational proofs, TAPSOFT '87, LNCS 250, pp. 276–290 (1987)
Dershowitz, N. and Manna, Z.: Proving termination with multiset orderings, Comm. ACM 22, pp. 465–467 (1979)
Dershowitz, N.: Orderings for term-rewriting systems, Theoretical Computer Science 17, pp. 279–301 (1982)
Fages, F.: Associative-commutative unification, 7th International Conference on Automated Deduction, LNCS 170, pp. 194–208 (1984)
Fages, F. and Huet, G.: Complete sets of unifiers and matchers in equational theories, Theoretical Computer Science 43, pp. 189–200 (1986)
Fay, M.: First order unification in an equational theory, 4th workshop on Automated Deduction, Austin, Texas, pp. 161–167 (1979)
Gallier, J. H. and Snyder, W.: A general complete E-unification procedure, Rewriting Techniques and Applications, LNCS 256, pp. 216–227 (1987)
Hsiang, J.: Rewrite method for theorem proving in first order theory with equality, J. Symbolic Computation, 3, 133–151 (1987)
Huet, G.: An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations, Inform. Process. Lett. 7, pp. 144–147 (1978)
Huet, G. and Oppen, D. C.: Equations and Rewrite Rules: a survey, Formal Language: Perspectives and Open Problems Academic Press, pp. 349–405 (1980)
Huet, G.: A complete proof of correctness of the Knuth-Bendix completion algorithm, J. Computer and System Science 23, pp. 11–21 (1981)
Hullot, J. M.: Canonical forms and unification, 5th Workshop on Automated Deduction, LNCS 87, pp. 318–334 (1980)
Knuth, D. E. and Bendix, P. B.: Simple word problems in universal algebras, Computational problems in abstract algebra, Pergamon Press, Oxford (1970)
Makanin, G. S.: The problem of solvability of equations in a free semigroup, Soviet Akad. Nauk SSSR, Tom 233, No. 2 (1977)
Robinson, J. A.: A machine-oriented logic based on the resolution principle, J. ACM 12, pp. 23–41 (1965)
Rusinowitch, M.: Theorem-proving with resolution and superposition: an extension of the Knuth and Bendix procedure to acomplete set of inference rules, International Conference on Fifth Generation Computer Systems, 1988, pp. 524–531 (1988)
Sakai, K.: An ordering method for term rewriting systems, Technical Report 062, ICOT (1984)
Siekmann, J. H.: Unification theory, J. Symbolic Computation 7, pp. 207–274 (1989)
Smullyan, R. M.: To Mock a Mockingbird, Alfred A. Knopf, Inc. (1985)
Stickel, M.E.: A unification algorithm for associative-commutative functions, J. ACM, 28, 3, pp. 423–434 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohsuga, A., Sakai, K. (1992). Complete equational unification based on an extension of the Knuth-Bendix completion procedure. In: Schulz, K.U. (eds) Word Equations and Related Topics. IWWERT 1990. Lecture Notes in Computer Science, vol 572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55124-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-55124-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55124-9
Online ISBN: 978-3-540-46737-3
eBook Packages: Springer Book Archive