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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-00955691
Contributor : Alain Monteil <>
Submitted on : Wednesday, March 5, 2014 - 9:31:17 AM
Last modification on : Thursday, February 7, 2019 - 4:56:55 PM
Document(s) archivé(s) le : Thursday, June 5, 2014 - 10:52:26 AM

File

dm010105.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00955691, version 1

Collections

Citation

Sébastien Limet, Pierre Réty. E-unification by means of tree tuple synchronized grammars. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1997, 1, pp.69-98. ⟨hal-00955691⟩

Share

Metrics

Record views

178

Files downloads

349