Unification in a class of permutative theories

Authors:
Thierry Boy de la Tour;Mnacho Echenim
Affiliations:
LEIBNIZ laboratory, IMAG – CNRS, INPG, Grenoble Cedex;LEIBNIZ laboratory, IMAG – CNRS, INPG, Grenoble Cedex
Venue:
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Year:
2005

Citing 4
Cited 1

Term rewriting and all that

Term rewriting and all that
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
General Algorithms for Permutations in Equational Inference

Journal of Automated Reasoning
On the Complexity of Deduction Modulo Leaf Permutative Equations

Journal of Automated Reasoning

Permutative rewriting and unification

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been proposed in [1] to perform deduction modulo leaf permutative theories, which are notoriously hard to handle directly in equational theorem proving. But unification modulo such theories is a difficult task, not tackled in [1]; a subclass of flat equations has been considered only recently, in [2]. Our emphasis on group theoretic structures led us in [6] to the definition of a more general subclass of leaf permutative theories, the unify-stable theories. They have good semantic and algorithmic properties, which we use here to design a complete unification algorithm.