E-unification by means of tree tuple synchronized grammars - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 1997

E-unification by means of tree tuple synchronized grammars

Abstract

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.
Fichier principal
Vignette du fichier
dm010105.pdf (413.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00955691 , version 1 (05-03-2014)

Identifiers

Cite

Sébastien Limet, Pierre Réty. E-unification by means of tree tuple synchronized grammars. Discrete Mathematics and Theoretical Computer Science, 1997, Vol. 1, pp.69-98. ⟨10.46298/dmtcs.240⟩. ⟨hal-00955691⟩
88 View
664 Download

Altmetric

Share

Gmail Facebook X LinkedIn More