Permutative rewriting and unification

Permutative rewriting provides a way of analyzing deduction modulo a theory defined by leaf-permutative equations. Our analysis naturally leads to the definition of the class of unify-stable axiom sets, in order to enforce a simple reduction strategy. We then give a uniform unification algorithm modulo theories E axiomatized this way. We prove that it computes complete sets of unifiers of simply exponential cardinality, and that the E-unification decision problem belongs to NP.

[1]  Claude Kirchner,et al.  Syntactic theories and unification , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[2]  Mnacho Echenim,et al.  Overlapping Leaf Permutative Equations , 2004, IJCAR.

[3]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[4]  Albrecht Fortenbacher.  An Algebraic Approach to Unification Under Associativity and Commutativity , 1987, J. Symb. Comput..

[5]  Christoph M. Hoffmann,et al.  Group-Theoretic Algorithms and Graph Isomorphism , 1982, Lecture Notes in Computer Science.

[6]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Christopher Lynch,et al.  Basic Syntactic Mutation , 2002, CADE.

[9]  John E. Hopcroft,et al.  Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Mnacho Echenim,et al.  Unification in a Class of Permutative Theories , 2005, RTA.

[11]  Manfred Schmidt-Schauß,et al.  Unification in Permutative Equational Theories is Undecidable , 1989, J. Symb. Comput..

[12]  Gregory Butler.  Soluble permutation groups , 1991 .

[13]  François Fages.  Associative-Commutative Unification , 1987, J. Symb. Comput..

[14]  Mark E. Stickel,et al.  A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.

[15]  Robert Nieuwenhuis,et al.  Decidability and Complexity Analysis by Basic Paramodulation , 1998, Inf. Comput..

[16]  Franz Baader.  Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases , 1993, JACM.

[17]  Gregory Butler,et al.  Fundamental Algorithms for Permutation Groups , 1991, Lecture Notes in Computer Science.

[18]  Alan Robinson,et al.  Handbook of automated reasoning , 2001 .

[19]  Franz Baader,et al.  Unification theory , 1986, Decis. Support Syst..

[20]  J. Cheney,et al.  A sequent calculus for nominal logic , 2004, LICS 2004.

[21]  Jürgen Avenhaus,et al.  Efficient Algorithms for Computing Modulo Permutation Theories , 2004, IJCAR.

[22]  Paliath Narendran,et al.  Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories , 2004, Journal of Automated Reasoning.