Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

RTA
1991
Springer

favoriteEmaildiscussreport

151views Theoretical Computer Science» more RTA 1991»

Narrowing Directed by a Graph of Terms

13 years 8 months ago

Narrowing Directed by a Graph of Terms

Download www.univ-orleans.fr

Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve the termination. The idea consists in using a finite graph of terms built from the rewriting system and the equation to be solved, which helps one to know the narrowing derivations possibly leading to solutions. Thus, the other derivations are not computed. This method is proved complete. An example is given and some improvements are proposed.

Jacques Chabin, Pierre Réty

Real-time Traffic

Narrowing Derivations | Rewriting System | RTA 1991 | Terminating Rewriting Systems | Theoretical Computer Science |

claim paper

Related Content

» Complete Strategies for Term Graph Narrowing

» GoalDirected and Relative Dependency Pairs for Proving the Termination of Narrowing

» HTTP as the narrow waist of the future internet

» Short Proofs are Narrow Resolution Made Simple

» From Path Graphs to Directed Path Graphs

» GOMIT A Generic and Adaptive Annotation Algorithm Based on Gene Ontology Term Distribution...

» Lazy Context Cloning for NonDeterministic Graph Rewriting

» Heterogeneous HardwareSoftware System Partitioning using Extended Directed Acyclic Graph

» Symmetrizations for clustering directed graphs

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	RTA
Authors	Jacques Chabin, Pierre Réty

Comments (0)