Discrete Mathematics & Theoretical Computer Science, Vol 1 (1997)

Font Size:  Small  Medium  Large

E-unification by means of tree tuple synchronized grammars

Sébastien Limet, Pierre Réty


The goal of this paper is both to give an E-unification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructor-based 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 upon unifiability thanks to an emptiness test. Moreover, we show that if only three of the four additional restrictions are satisfied then unifiability is undecidable.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page