Sciweavers

764 search results - page 92 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
PSSE
2004
Springer
15 years 5 months ago
Developing and Reasoning About Probabilistic Programs in pGCL
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
Annabelle McIver, Carroll Morgan
POPL
1995
ACM
15 years 3 months ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
IPPS
2007
IEEE
15 years 6 months ago
A Markov Reward Model for Software Reliability
A compositional method for estimating software reliability of many threaded programs is developed. The method uses estimates of the reliability of individual modules and the proba...
YoungMin Kwon, Gul Agha
ICFP
2006
ACM
15 years 11 months ago
Type-theoretic design patterns
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
Ondrej Rypacek, Roland Carl Backhouse, Henrik Nils...
ATAL
2003
Springer
15 years 5 months ago
Model checking agentspeak
This paper introduces AgentSpeak(F), a variation of the BDI logic programming language AgentSpeak(L) intended to permit the model-theoretic verification of multi-agent systems. A...
Rafael H. Bordini, Michael Fisher, Carmen Pardavil...