Sciweavers

553 search results - page 52 / 111
» A General Theory of Additive State Space Abstractions
Sort
View
IJCAI
2001
13 years 10 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
ATAL
2007
Springer
14 years 2 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
SOFTWARE
2008
13 years 8 months ago
What Do We Know about Developer Motivation?
s of titles and abstracts) as irrelevant to our focus. We read the remaining 519 papers in full to establish our final list. The 92 papers we chose were originally published in the...
Tracy Hall, Helen Sharp, Sarah Beecham, Nathan Bad...
POPL
2010
ACM
14 years 6 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
ATAL
2006
Springer
13 years 10 months ago
Logics of propositional control
The `Cooperation Logic of Propositional Control', cl-pc, of van der Hoek and Wooldridge is a logic for reasoning about the ability of agents and groups of agents to obtain a ...
Jelle Gerbrandy