Abstract
In a recent paper [BS91] we introduced a new unification algorithm for the combination of disjoint equational theories. Among other consequences we mentioned (1) that the algorithm provides us with a decision procedure for the solvability of general A- and AI-unification problems and (2) that Kapur and Narendran's result about the NP-decidability of the solvability of general AC- and ACI-unification problems (see [KN91]) may be obtained from our results. In [BS91] we did not give detailled proofs for these two consequences. In the present paper we will treat these problems in more detail. Moreover, we will use the two examples of general A- and AI-unification for a case study of possible optimizations of the basic combination procedure.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.H. BlÄsius, H.-J. Bürckert, “Deduktionssysteme,” Oldenbourg Verlag, München Wien (1987).
F. Baader, K.U. Schulz, “Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures,” DFKI-Research Report RR-91-33, to appear in the Proceedings of the 11th International Conference on Automated Deduction, LNCS (1992).
J.A. Brzozowski, K. Culik, A. Gabrielian, “Classification of Noncounting Events,” J. Computer and System Science 5, 1971.
H.-J. Bürckert, “A Resolution Principle for Clauses with Constraints,” Proceedings of the 10th International Conference on Automated Deduction, LNCS 449, 1990.
A. Colmerauer, “An Introduction to PROLOG III,” C. ACM 33, 1990.
W.F. Dowling, J. Gallier, “Linear Time Algorithms for Testing Satisfiability of Propositional Horn Formula,” J. Logic Programming 3, 1984.
F. Fages, “Associative-Commutative Unification,” Proceedings of the 7th International Conference on Automated Deduction, LNCS 170, 1984.
J.P. Jouannaud, C. Kirchner, “Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification,” Preprint, 1990. To appear in the Festschrift to Alan Robinson's birthday.
J. Jaffar, J.L. Lassez, “Constraint Logic Programming,” Proceedings of 14th POPL Conference, Munich, 1987.
D. Kapur, P. Narendran, “Complexity of Unification Problems with Associative-Commutative Operators,” Preprint, 1991. To appear in J. Automated Reasoning.
C. Kirchner, H. Kirchner, “Constrained Equational Reasoning,” Proceedings of SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, ACM Press, 1989.
G.S. Makanin, “The Problem of Solvability of Equations in a Free Semigroup,” Mat. USSR Sbornik 32, 1977.
D. McLean, “Idempotent Semigroups,” Am. Math. Mon. 61, 1954.
M. Schmidt-Schau\, “Combination of Unification Algorithms,” J. Symbolic Computation 8, 1989.
K.U. Schulz, “Makanin's Algorithm — Two Improvements and a Generalization,” Proceedings of the First International Workshop on Word Equations and Related Topics IWWERT '90, Tübingen 1990, Springer LNCS 572.
K.U. Schulz, “Word Unification and Transformation of Generalized Equations,” CIS-Report 91-46, University of Munich, 1991 (see also this issue).
M. Stickel, “A Unification Algorithm for Associative-Commutative Functions,” J. ACM 28, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baader, F., Schulz, K.U. (1993). General A- and AX-unification via optimized combination procedures. In: Abdulrab, H., Pécuchet, JP. (eds) Word Equations and Related Topics. IWWERT 1991. Lecture Notes in Computer Science, vol 677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56730-5_29
Download citation
DOI: https://doi.org/10.1007/3-540-56730-5_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56730-1
Online ISBN: 978-3-540-47636-8
eBook Packages: Springer Book Archive