Abstract
In a previous paper we have introduced a method that allows one to combine decision procedures for unifiability in disjoint equational theories. Lately, it has turned out that the prerequisite for this method to apply—namely that unification with so-called linear constant restrictions is decidable in the single theories—is equivalent to requiring decidability of the positive fragment of the first order theory of the equational theories. Thus, the combination method can also be seen as a tool for combining decision procedures for positive theories of free algebras defined by equational theories. Complementing this logical point of view, the present paper isolates an abstract algebraic property of free algebras—called combinability—that clarifies why our combination method applies to such algebras. We use this algebraic point of view to introduce a new proof method that depends on abstract notions and results from universal algebra, as opposed to technical manipulations of terms (such as ordered rewriting, abstraction functions, etc.) With this proof method, the previous combination results for unification can easily be extended to the case of constraint solvers that also take relational constraints (such as ordering constraints) into account. Background information from universal algebra about free structures is given to clarify the algebraic meaning of our results.
This author was supported by the EC Working Group CCL, EP6028.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Boudet. Combining unification algorithms. J. Symbolic Computation, 16:597–626, 1993.
F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In Proceedings of CADE-11, LNCS 607, 1992.
F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures, 1993. Extended version, submitted for publication.
F. Baader and K.U. Schulz. Combination techniques and decision problems for disunification. In Proceedings of RTA-93, LNCS 690, 1993.
F. Baader and K.U. Schulz. Combination of Constraint Solving Techniques: An Algebraic Point of View. Research Report CIS-Rep-94-75, CIS, University Munich, 1994. This report is available via anonymous ftp from “cantor.informatik.rwth-aachen.de” in the directory “pub/papers.”
H.-J. Bürckert. A Resolution Principle for a Logic with Restricted Quantifiers, LNCS 568, 1991.
P.M. Cohn. Universal Algebra. Harper & Row, New York, 1965.
H. Comon and P. Lescanne. Equational problems and disunification. J. Symbolic Computation, 7:371–425, 1989.
H. Comon and R. Treinen. Ordering constraints on trees. In Colloquium on Trees in Algebra and Programming (CAAP), LNCS, 1994.
N. Dershowitz. Termination of rewriting. J. Symbolic Computation, 3:69–116, 1987.
E. Domenjoud, F. Klay, and Ch. Ringeissen. Combination techniques for non-disjoint theories. In Proceedings of CADE-12, LNCS 814, 1994.
C. Kirchner and H. Kirchner. Constrained equational reasoning. In Proceedings of SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation. ACM Press, 1989.
H. Kirchner and Ch. Ringeissen. Combining symbolic constraint solvers on algebraic domains. J. Symbolic Computation, 18(2):113–155, 1994.
M.J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings of LICS'88, IEEE Computer Society, 1988.
A.I. Mal'cev. The Metamathematics of Algebraic Systems, volume 66 of Studies in Logic and the Foundation of Mathematics. North Holland, Amsterdam, London, 1971.
A.I. Mal'cev. Algebraic Systems, volume 192 of Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen. Springer, Berlin, 1973.
G. Nelson and D.C. Oppen. Simplification by cooperating decision procedures. ACM TOPLAS, 1(2):245–257, 1979.
Ch. Ringeissen. Unification in a combination of equational theories with shared constants and its application to primal algebras. In Proceedings of LPAR'92, LNCS 624, 1992.
R. Nieuwenhuis and A. Rubio, “AC-superposition with constraints: No ACunifiers needed,” in: Proceedings CADE-12, Springer LNAI 814, 1994.
M. Schmidt-Schauß. Unification in a combination of arbitrary disjoint equational theories. J. Symbolic Computation, 8(1,2):51–99, 1989.
N. Weaver. Generalized varieties. Algebra Universalis, 30:27–52, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baader, F., Schulz, K.U. (1995). Combination of constraint solving techniques: An algebraic point of view. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_69
Download citation
DOI: https://doi.org/10.1007/3-540-59200-8_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59200-6
Online ISBN: 978-3-540-49223-8
eBook Packages: Springer Book Archive