Combining Pattern E-Unification Algorithms

Authors:
Alexandre Boudet;Evelyne Contejean
Affiliations:
-;-
Venue:
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Year:
2001

Citing 13
Cited 0

Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
On word problems in equational theories

14th International Colloquium on Automata, languages and programming
Associative-commutative unification

Journal of Symbolic Computation
Unification theory

Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories

Journal of Symbolic Computation
A logic programming language with Lambda-abstraction, function variables, and simple unification

Proceedings of the international workshop on Extensions of logic programming
Executable higher-order algebraic specifications

STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Combining unification algorithms

Journal of Symbolic Computation
Unification in the union of disjoint equational theories: combining decision procedures

Journal of Symbolic Computation
Higher-order rewrite systems and their confluence

Theoretical Computer Science - Special issue: rewriting systems and applications
Modular AC Unification of Higher-Order Patterns

CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
About the Confluence of Equational Pattern Rewrite Systems

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A complete unification algorithm for associative-commutative functions

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for unification of higher-order patterns modulo combinations of disjoint first-order equational theories. This algorithm is highly non-deterministic, in the spirit of those by Schmidt-Schauß [20] and Baader-Schulz [1] in the first-order case. We redefine the properties required for elementary pattern unification algorithms of pure problems in this context, then we show that some theories of interest have elementary unification algorithms fitting our requirements. This provides a unification algorithm for patterns modulo the combination of theories such as the free theory, commutativity, one-sided distributivity, associativity-commutativity and some of its extensions, including Abelian groups.