149 search results - page 18 / 30 » Encoding Planning Problems in Nonmonotonic Logic Programs |
125
Voted
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...
215
click to vote
AGP
2010
IEEE
15 years 7 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
118
Voted
PPDP
2010
Springer
15 years 11 days ago
2010
Springer
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
111
click to vote
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
133
click to vote
AAAI
1996
15 years 3 months ago
1996
Markov decision processes (MDPs) are a very popular tool for decision theoretic planning (DTP), partly because of the welldeveloped, expressive theory that includes effective solu...