Sciweavers

23201 search results - page 43 / 4641
» Rewriting Systems with Data
Sort
View
ICLP
1997
Springer
14 years 2 months ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
CSB
2005
IEEE
163views Bioinformatics» more  CSB 2005»
14 years 3 months ago
A symbolic approach to the simulation of biochemical models: application to circadian rhythms
Symbolic rewriting systems are gaining interest as tools for simulating biochemical dynamics. Compared to traditional methods based on differential equations, the symbolic approac...
Federico Fontana, Luca Bianco, Vincenzo Manca
CCS
2005
ACM
14 years 3 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
POPL
1997
ACM
14 years 1 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
AI
2000
Springer
14 years 2 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