93 search results - page 11 / 19 » Temporal Probabilistic Logic Programs: State and Revision |
ROBOCUP
2000
Springer
13 years 11 months ago
2000
Springer
Building agents for a scenario such as the RoboCup simulation league requires not only methodologies for implementing high-level complex behavior, but also the careful and efficien...
ICFP
2000
ACM
13 years 12 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
AICOM
2010
13 years 7 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
IPPS
2000
IEEE
14 years 6 hour ago
2000
IEEE
We propose a high-level language based on rst order logic for expressing synchronization in concurrent object-oriented programs. The language allows the programmer to declaratively...