# "Syntactic" AC-Unification

@inproceedings{Boudet1994SyntacticA, title={"Syntactic" AC-Unification}, author={Alexandre Boudet and Evelyne Contejean}, booktitle={CCL}, year={1994} }

The rules for unification in a simple syntactic theory, using Kirchner's mutation [15, 16] do not terminate in the case of associative-commutative theories. We show that in the case of a linear equation, these rules terminate, yielding a complete set of solved forms, each variable introduced by the unifiers corresponding to a (trivial) minimal solution of the (trivial) Diophantine equation where all coefficients are 1. A non-linear problem can be first treated as a linear one, that is…

## 6 Citations

Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories

- Computer ScienceDiscret. Math. Theor. Comput. Sci.
- 2000

An algorithm for unification of higher-order patterns modulo simple syntactic equational theories as defined by Kirchner, modified in order to behave as a first-order unification algorithm.

Combining Pattern E-Unification Algorithms

- Mathematics, Computer ScienceRTA
- 2001

An algorithm for unification of higher-order patterns modulo combinations of disjoint first-order equational theories, including Abelian groups, is presented.

Constraint Solving on Terms : Syntactic Methods Preliminary lecture notes

- Computer Science
- 1999

This lecture is presenting the main results on symbolic constraint solving for equational unification, dis-unification and some ordering constraints.

Problems in Rewriting III

- Environmental ScienceRTA
- 1995

This paper aims to demonstrate the efforts towards in-situ applicability of EMMARM, the objective of which is to provide real-time information about the response of the immune system to computer attacks.

Modeling Permutations in Coqfor Coccinelle

- Computer Science, MathematicsRewriting, Computation and Proof
- 2007

The part of the Coccinelle library which deals with list permutations is presented, and the notion of permutation w.

Rule-Based Constraint Programming

- Computer ScienceFundam. Informaticae
- 1998

A view of constraint programming based on the notion of rewriting controlled by strategies allows us to describe in a unified way the constraint solving mechanism as well as the meta-language needed to manipulate the constraints.

## References

SHOWING 1-10 OF 44 REFERENCES

A new AC unification algorithm with an algorithm for solving systems of diophantine equations

- Mathematics[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
- 1990

A novel AC-unification algorithm is presented. A combination technique for regular collapse-free theories is provided along the line developed by A. Boudet et al. (1989). The number of calls to the…

Syntactic theories and unification

- Computer Science[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
- 1990

The authors prove that the theory of associativity and commutativity is syntactic, which allows one, by the combination of Nipkow's results and the authors', to infer a novel matching algorithm where there is no need to solve linear diophantine equations.

An Algebraic Approach to Unification Under Associativity and Commutativity

- Mathematics, Computer ScienceJ. Symb. Comput.
- 1987

Rewrite Systems

- Computer ScienceHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
- 1990

Undecidable Properties of Syntactic Theories

- MathematicsRTA
- 1991

It is claimed that the condition of syntacticness is too weak to get unification algorithms directly, and unifiability in syntactic theories is not decidable, resolventness of a presentation and syntactics of a theory are even not semidecidable.

Double-exponential complexity of computing a complete set of AC-unifiers

- Computer Science, Mathematics[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science
- 1992

Since there is a family of simple associative-commutative unification problems which have complete sets of unifiers whose size is doubly exponential, the algorithm is optimal in its order of complexity in this sense.

Proof transformations for equational theories

- Mathematics[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
- 1990

After a study of proof translations defined by rewriting systems, equivalence tests based on the notion of resolvent theories are used to derive novel matching and, in some cases unification procedures for a number of equational theories.

A Unification Algorithm for Associative-Commutative Functions

- Computer ScienceJACM
- 1981

An algorithm which unifies terms whose function is associative and commutative is presented here and termmaaon, soundness, and completeness of the algorithm have been proved for a subclass of the general case.

A New Approach to Universal Unification and Its Application to AC-Unification

- Computer ScienceCADE
- 1988

A complete unification algorithm for simple theories is described and a partial correctness proof is given and some preliminary termination results for the AC case are presented.