Results 1 
3 of
3
EUnification by Means of Tree Tuple Synchronized Grammars
, 1996
"... : The goal of this paper is both to give a Eunification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructorbased rewrite system, and that four additional restrictions are satisfied. We give a proce ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
: The goal of this paper is both to give a Eunification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructorbased rewrite system, and that four additional restrictions are satisfied. We give a procedure that represents the (possibly infinite) set of solutions thanks to a tree tuple synchronized grammar, and that can decide unifiability thanks to an emptiness test. Moreover we show that if only three of the four additional restrictions are satisfied then unifiability is undecidable. 1 Introduction First order Eunification [29] is a tool that plays an important role in automated deduction, in particular in functional logic programming and for solving symbolic constraints (see [4] for an extensive survey of the area). It consists in finding instances to variables that make two terms equal modulo an equational theory given by a set of equalities, i.e. it amounts to solve an equation (ca...