24 search results - page 4 / 5 » An Effective QBF Solver for Planning Problems |
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
We argued in our Flexible Graphplan (FGP) work that the classical definition of the planning problem is too rigid to capture the full subtlety of many real problems. In light of t...
ECAI
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
AI
2007
Springer
13 years 5 months ago
2007
Springer
AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as inp...
AIPS
2010
13 years 8 months ago
2010
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
JNSM
2008
13 years 5 months ago
2008
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...