Sciweavers

882 search results - page 29 / 177
» A Taste of Rewrite Systems
Sort
View
POPL
1997
ACM
13 years 11 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
AI
2000
Springer
13 years 12 months ago
Learning Rewrite Rules versus Search Control Rules to Improve Plan Quality
Domain independent planners can produce better-quality plans through the use of domain-speci c knowledge, typically encoded as search control rules. The planning-by-rewriting appro...
Muhammad Afzal Upal, Renee Elio
ENTCS
2007
128views more  ENTCS 2007»
13 years 7 months ago
Rewriting-Based Access Control Policies
In this paper we propose a formalization of access control policies based on term rewriting. The state of the system to which policies are enforced is represented as an algebraic ...
Anderson Santana de Oliveira
ENTCS
2000
123views more  ENTCS 2000»
13 years 7 months ago
Defining Standard Prolog in Rewriting Logic
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
Marija Kulas, Christoph Beierle
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