Sciweavers

148 search results - page 10 / 30
» Programming with angelic nondeterminism
Sort
View
ECAI
2000
Springer
14 years 2 months ago
Turning High-Level Plans into Robot Programs in Uncertain Domains
The actions of a robot like lifting an object are often best thought of as low-level processes with uncertain outcome. A highlevel robot plan can be seen as a description of a task...
Henrik Grosskreutz, Gerhard Lakemeyer
PPDP
2004
Springer
14 years 3 months ago
A semantics for tracing declarative multi-paradigm programs
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
Bernd Brassel, Michael Hanus, Frank Huch, Germ&aac...
AGTIVE
2007
Springer
14 years 4 months ago
Programmed Graph Rewriting with DEVS
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
Eugene Syriani, Hans Vangheluwe
PPDP
2007
Springer
14 years 3 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
FM
2006
Springer
133views Formal Methods» more  FM 2006»
14 years 1 months ago
Enforcer - Efficient Failure Injection
Non-determinism of the thread schedule is a well-known problem in concurrent programming. However, other sources of non-determinism exist which cannot be controlled by an applicati...
Cyrille Artho, Armin Biere, Shinichi Honiden