Unification in Extension of Shallow Equational Theories

We show that unification in certain extensions of shallow equational theories is decidable. Our extensions generalize the known classes of shallow or standard equational theories. In order to prove decidability of unification in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality constraints between brother subterms as well as shallow sort theories. We show that saturation under sorted superposition is effective on sorted shallow equational theories. So called semi-linear equational theories can be effectively transformed into equivalent sorted shallow equational theories and generalize the classes of shallow and standard equational theories.

[1]  Sebastian Maneth,et al.  A Strict Border for the Decidability of E-Unification for Recursive Functions , 1998, J. Funct. Log. Program..

[2]  Robert Nieuwenhuis.  Basic Paramodulation and Decidable Theories (Extended Abstract) , 1996, LICS 1996.

[3]  Jean-Pierre Jouannaud,et al.  Syntacticness, Cycle-Syntacticness, and Shallow Theories , 1994, Inf. Comput..

[4]  Christoph Weidenbach.  Sorted Unification and Tree Automata , 1998 .

[5]  Paliath Narendran,et al.  Some Independence Results for Equational Uniication , 1995 .

[6]  Albert Rubio,et al.  Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..

[7]  W. Bibel,et al.  Automated deduction : a basis for applications , 1998 .

[8]  Florent Jacquemard,et al.  Decidable Approximations of Term Rewriting Systems , 1996, RTA.

[9]  Sophie Tison,et al.  Equality and Disequality Constraints on Direct Subterms in Tree Automata , 1992, STACS.

[10]  Aart Middeldorp,et al.  Decidable Call by Need Computations in term Rewriting (Extended Abstract) , 1997, CADE.

[11]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[12]  Sébastien Limet,et al.  E-unification by means of tree tuple synchronized grammars , 1997, Discret. Math. Theor. Comput. Sci..

[13]  Paliath Narendran,et al.  Some Independent Results for Equational Unification , 1995, RTA.

[14]  M. Oyamaguchi.  On the word problem for right-ground term-rewriting systems , 1990 .

[15]  Robert Nieuwenhuis,et al.  Basic paramodulation and decidable theories , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[16]  Claude Kirchner.  Computing Unification Algorithms , 1986, LICS.

[17]  KozenDexter.  Positive first-order logic is NP-complete , 1981 .

[18]  Tadao Kasami,et al.  Solving a Unification Problem under Constrained Substitutions Using Tree Automata , 1994, J. Symb. Comput..

[19]  Hubert Comon,et al.  Sequentiality, second order monadic logic and tree automata , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[20]  Christoph Weidenbach,et al.  Soft Typing for Ordered Resolution , 1997, CADE.

[21]  Wayne Snyder,et al.  Basic Paramodulation , 1995, Inf. Comput..

[22]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[23]  Christoph Weidenbach.  Computational aspects of a first-order logic with sorts , 1996 .