39 search results - page 2 / 8 » Efficient Pruning of Operators in Planning Domains |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
AUSAI
2007
Springer
13 years 9 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
AIPS
2009
13 years 6 months ago
2009
PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurr...
AAI
2005
13 years 5 months ago
2005
The application of AI planning techniques to manufacturing systems is being widely deployed for all the tasks involved in the process, from product design to production planning an...