Sciweavers

23201 search results - page 52 / 4641
» Rewriting Systems with Data
Sort
View
CADE
2001
Springer
16 years 6 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain
ALP
1994
Springer
15 years 10 months ago
Logic Programs as term Rewriting Systems
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
Massimo Marchiori
PLILP
1994
Springer
15 years 10 months ago
Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
John Field, Frank Tip
JAR
2006
87views more  JAR 2006»
15 years 6 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...
NAACL
2010
15 years 3 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea