Sébastien Limet, Pierre Réty  @ NUS Home/Search
Context
Related
| lifo.univorleans.fr/pub...caap97.ps.gz Cached: PS.gz PS PDF Image Update Help From: web.univorleans.f...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : The goal of this paper is both to give a 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 new kind of grammar, called tree tuple synchronized grammar, and that can decide unifiability thanks to an emptiness test.... (Update)
Similar documents (at the sentence level):
58.1%: E-Unification by Means of Tree Tuple Synchronized Grammars - Limet, Réty (1997) (Correct)
52.4%: On Decidability of Unifiability modulo Rewrite Systems - Limet, Réty (1996) (Correct)
12.2%: Solving Disequations modulo some Class of Rewrite Systems - Limet, Réty (1998) (Correct)
Active bibliography (related documents): More All
0.2: Unification in Extensions of Shallow Equational Theories - Jacquemard, Meyer, Weidenbach (1998) (Correct)
0.2: A Strict Border for the Decidability of E-Unification for.. - Maneth, Faßbender (1998) (Correct)
0.1: On Partial Validation of Logic Programs - Limet, Saubion (1997) (Correct)
Similar documents based on text: More All
0.5: Synchronized Tree Languages Revisited and New Applications - Gouranton, Réty.. (2001) (Correct)
0.2: Weakly Regular Relations and Applications - Limet, Réty, Seidl (2001) (Correct)
0.2: Regular Sets of Descendants for Constructor-based Rewrite Systems - Réty (1999) (Correct)
BibTeX entry: (Update)
@misc{ limet-eunification,
author = "Sébastien Limet and Pierre Réty",
title = "E-Unification by Means of Tree Tuple Synchronized Grammars",
url = "citeseer.comp.nus.edu.sg/132007.html" }
Citations (may not include all citations):788 Rewrite Systems - Dershowitz, Jouannaud - 1990
126 Canonical Forms and Unification (context) - Hullot - 1980
28 Information and Computation (context) - Comon, Haberstrau et al. - 1994
26 Basic Paramodulation and Decidable Theories (context) - Nieuwenhuis - 1996
12 unification and complexity (context) - Kapur, Narendran - 1987
11 Some new decidability results on positive and negative set c.. (context) - Gilleron, Tison et al. - 1994
10 Solving a Unification Problem under Constrained Substitution.. (context) - Kaji, Fujiwara et al. - 1994
8 Tree Grammars with Multilinear Interpretation (context) - Guan, Hotz et al. - 1992
8 Unification by Means of Tree Tuple Synchronized Grammars (context) - Limet, R'ety - 1996
6 Semantic Unification for Convergent Rewrite Systems (context) - Mitra - 1994
6 Some Termination Criteria for Narrowing and E-Unification (context) - Christian - 1992
2 A strict border for the decidability of E-unification for re.. - FaBetabender, Maneth - 1996
Documents on the same site (http://web.univ-orleans.fr/SCIENCES/LIFO/Membres/rety/publications.html): More
E-Unification by Means of Tree Tuple Synchronized Grammars - Limet, Réty (1997) (Correct)
On Decidability of Unifiability modulo Rewrite Systems - Limet, Réty (1996) (Correct)
Solving Disequations modulo some Class of Rewrite Systems - Limet, Réty (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.