Sciweavers

500 search results - page 22 / 100
» ACD Term Rewriting
Sort
View
CORR
2008
Springer
140views Education» more  CORR 2008»
13 years 7 months ago
A Cloning Pushout Approach to Term-Graph Transformation
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...
Dominique Duval, Rachid Echahed, Fréd&eacut...
ENTCS
2002
128views more  ENTCS 2002»
13 years 7 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
ACL
2011
12 years 11 months ago
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...
CADE
2012
Springer
11 years 9 months ago
Rewriting Induction + Linear Arithmetic = Decision Procedure
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
Stephan Falke, Deepak Kapur
CADE
2012
Springer
11 years 9 months ago
Proving Non-looping Non-termination Automatically
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...
Fabian Emmes, Tim Enger, Jürgen Giesl