Skip to Main content Skip to Navigation

# Towards Deciding Second-order Unification Problems Using Regular Tree Automata

* Corresponding author
2 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : The second-order unification problem is undecidable . While unification procedures, like Huet's pre-unification, terminate with success on unifiable problems, they might not terminate on non-unifiable ones. There are several decidability results for unification problems with infinitely-many pre-unifiers, such as for monadic second-order problems . These results are based on the regular structure of the solutions of these problems and by computing minimal unifiers. Beyond the importance of the knowledge that searching for unifiers of decidable problems always terminates, one can also use this information in order to optimize unification algorithms, such as in the case for pattern unification . Nevertheless, being able to prove that the unification problem of a certain class of unification constraints is decidable is far from easy. Some results were obtained for certain syntactic restrictions on the problems (see Levy  for some results and references) or on the unifiers (see Schmidt-Schauß , Schmidt-Schauß and Schulz [12, 13] and Je˙ z  for some results). Infinitary unification problems, like the ones we are considering, might suggest that known tools for dealing with the infinite might be useful. One such tool is the regular tree automaton. The drawback of using regular automata for unification is, of course, their inability to deal with variables. In this paper we try to overcome this obstacle and describe an ongoing work about using regular tree automata  in order to decide more general second-order unification problems. The second-order unification problems we will consider are of the form λz n .x 0 t. = λz n .C(x 0 s) where C is a non-empty context  and x 0 does not occur in t or s. We will call such problems cyclic problems. An important result in second-order unification was obtained by Ganzinger et al.  and stated that second-order unification is undecidable already when there is only one second-order variable occurring twice. The unification problem they used for proving the undecidability result was an instance of the following cyclic problem. Note that we chose to use in the definition only unary second-order variables but that this restriction should not be essential. x 0 (w 1 , g(y 1 , a)) = g(y 2 , x 0 (w 2 , a)) (1) Our decidability result is obtained by posing one further restriction over cyclic problems which is based on the existence and location of variables other than the cyclic one. A sufficient condition for the decidability of second-order unification problems was given by Levy . This condition states that if we can never encounter, when applying Huet's pre-unification procedure  to a problem, a cyclic equation, then the procedure terminates. It follows from this result that deciding second-order unification problems depends on the ability to decide cyclic problems. The rules of Huet's procedure (PUA) are given in Fig. 1. Imitation partial bindings and projection partial bindings are defined in  and are denoted, respectively, by PB(f, α) and PB(i, α) where α is a type, Σ a signature f ∈ Σ and i > 0.
Document type :
Conference papers
Domain :
Complete list of metadata

Cited literature [14 references]

https://hal.inria.fr/hal-01242233
Contributor : Tomer Libal <>
Submitted on : Friday, December 11, 2015 - 4:10:05 PM
Last modification on : Friday, April 30, 2021 - 10:02:39 AM
Long-term archiving on: : Saturday, April 29, 2017 - 1:03:34 PM

### File

paper.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-01242233, version 1

### Citation

Tomer Libal. Towards Deciding Second-order Unification Problems Using Regular Tree Automata. 29th International Workshop on Unification, Jun 2015, Warsaw, Poland. ⟨hal-01242233⟩

Record views

Files downloads