2067 search results - page 155 / 414 » Logics of propositional control |
120
click to vote
AIPS
2008
15 years 4 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
139
click to vote
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Although informative, the semantic definition proposed for the most standard agent communication language (FIPA ACL 1997) is complicated and contentious, while published interact...
114
click to vote
AIPS
2006
15 years 3 months ago
2006
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
117
click to vote
JAIR
2010
15 years 11 days ago
2010
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
164
click to vote
QEST
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...