On the Complexity of Deduction Modulo Leaf Permutative Equations

Authors:
Thierry Boy De La Tour;Mnacho Echenim
Affiliations:
LEIBNIZ Laboratory, CNRS, IMAG, Grenoble Cedex, France F-38031;LEIBNIZ Laboratory, CNRS, IMAG, Grenoble Cedex, France F-38031
Venue:
Journal of Automated Reasoning
Year:
2004

Citing 7
Cited 1

Term graph rewriting

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Permutation group algorithms based on partitions, I: Theory and algorithms

Journal of Symbolic Computation - Special issue on computational group theory: part 2
Automorphism groups, isomorphism, reconstruction

Handbook of combinatorics (vol. 2)
Term rewriting and all that

Term rewriting and all that
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
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

Unification in a class of permutative theories

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the context of equational reasoning, J. Avenhaus and D. Plaisted proposed to deal with leaf permutative equations in a uniform, specialized way. The simplicity of these equations and the useless variations that they produce are good incentives to lift theorem proving to so-called stratified terms, in order to perform deduction modulo such equations. This requires specialized algorithms for standard problems involved in automated deduction. To analyze the computational complexity of these problems, we focus on the group theoretic properties of stratified terms. NP-completeness results are given and (slightly) relieved by restrictions on leaf permutative theories, which allow the use of techniques from computational group theory.