15 search results - page 3 / 3 » Planning as Model Checking for Extended Goals in Non-determi... |
LOGCOM
2011
12 years 7 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
ISORC
2005
IEEE
13 years 10 months ago
2005
IEEE
Web Services form a new distributed computing paradigm. Collaborative verification and validation are important when Web Services from different vendors are integrated together to...
WSC
1997
13 years 6 months ago
1997
One of the key issues in reasoning with multiple interacting intelligent agents is how to model and code the decision making process of the agents. In Artificial Intelligence (AI...
NIPS
2007
13 years 6 months ago
2007
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
TACAS
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...