Sciweavers

94 search results - page 9 / 19
» Confluence of Conditional Rewrite Systems
Sort
View
CSCLP
2008
Springer
13 years 9 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
FLOPS
2010
Springer
13 years 6 months ago
Proving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
Naoki Nishida, Masahiko Sakai
RTA
2010
Springer
13 years 11 months ago
On (Un)Soundness of Unravelings
We revisit (un)soundness of transformations of conditional into unconditional rewrite systems. The focus here is on so-called unravelings, the most simple and natural kind of such ...
Karl Gmeiner, Bernhard Gramlich, Felix Schernhamme...
BIRTHDAY
2005
Springer
14 years 1 months ago
Reducing Right-Hand Sides for Termination
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...
Hans Zantema
ENTCS
2008
85views more  ENTCS 2008»
13 years 7 months ago
Innermost Termination of Rewrite Systems by Labeling
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
René Thiemann, Aart Middeldorp