Sciweavers

584 search results - page 3 / 117
» Logic Programs as term Rewriting Systems
Sort
View
LATA
2009
Springer
14 years 5 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 11 months ago
Automated Termination Proofs for Logic Programs by Term Rewriting
Peter Schneider-Kamp, Jürgen Giesl, Alexander...
ECEASST
2008
82views more  ECEASST 2008»
13 years 11 months ago
Interaction nets: programming language design and implementation
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...
Abubakar Hassan, Ian Mackie, Shinya Sato
ENTCS
2007
104views more  ENTCS 2007»
13 years 10 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang