Sciweavers

5216 search results - page 46 / 1044
» Planning as Model Checking
Sort
View
IJCAI
2003
14 years 10 days ago
Automated Generation of Understandable Contingency Plans
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
Max Horstmann, Shlomo Zilberstein
AAAI
1994
14 years 9 days ago
An Algorithm for Probabilistic Least-Commitment Planning
We de ne the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of goal propositions, a probability threshold, ...
Nicholas Kushmerick, Steve Hanks, Daniel S. Weld
AIPS
1994
14 years 9 days ago
Probabilistic Planning with Information Gathering and Contingent Execution
MostAI representations and algorithms for plan generation havenot included the concept of informationproducingactions (also called diagnostics, or tests, in the decision making li...
Denise Draper, Steve Hanks, Daniel S. Weld
JOLLI
2007
128views more  JOLLI 2007»
13 years 11 months ago
Linear temporal logic as an executable semantics for planning languages
This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning...
Marta Cialdea Mayer, Carla Limongelli, Andrea Orla...
TASE
2008
IEEE
14 years 5 months ago
Bounded Model Checking of Compositional Processes
Verification techniques like SAT-based bounded model checking have been successfully applied to a variety of system models. Applying bounded model checking to compositional proce...
Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Jing S...