Solving a Unification Problem under Constrained Substitutions Using Tree Automata

A unification problem under constrained substitutions, a generalization of the usual unification problems, is a useful formalization of a practical problem in which there are some constraints on operations and objects that we can use. In this paper, a procedure to solve the problem under some linearity conditions is introduced. Since the problem is undecidable in general, the procedure falls into an infinite loop for some instances. We clarify a decidable sufficient condition under which our procedure terminates, and review known classes of term rewriting systems that satisfy the condition. The procedure uses tree automata to solve the problem, which is quite a new and promising approach to unification problems.

[1]  Pierre Réty.  Improving Basic Narrowing Techniques , 1987, RTA.

[2]  Tadao Kasami,et al.  Decision Problem of the Security for Cryptographic Protocols , 1987 .

[3]  Corrado Moiso,et al.  An Algorithm for Unification in Equational Theories , 1986, SLP.

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

[5]  Robert Nieuwenhuis,et al.  On Narrowing, Refutation Proofs and Constraints , 1995, RTA.

[6]  Hubert Comon,et al.  Disunification: A Survey. , 1991 .

[7]  Jörg H. Siekmann.  Unification Theory , 1989, J. Symb. Comput..

[8]  Jean-Pierre Jouannaud,et al.  Decidable problems in shallow equational theories , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[9]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[10]  Hubert Comon.  Equational Formulas in Order-Sorted Algebras , 1990 .

[11]  M. Schmidt-Schauβ.  Computational Aspects of an Order-Sorted Logic with Term Declarations , 1989 .

[12]  Richard M. Karp,et al.  On the Security of Ping-Pong Protocols , 1982, Inf. Control..

[13]  Nachum Dershowitz,et al.  Solving Goals in Equational Languages , 1988, CTRS.

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

[15]  Jacques Chabin,et al.  Narrowing Directed by a Graph of Terms , 1991, RTA.

[16]  Ralf Treinen,et al.  Ordering Constraints on Trees , 1994, CAAP.

[17]  Wayne Snyder,et al.  A General Complete E-Unification Procedure , 1987, RTA.