169 search results - page 4 / 34 » Tractability of Planning with Loops |
FLAIRS
2008
15 years 20 days ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
100
click to vote
FLAIRS
2004
14 years 11 months ago
2004
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
79
Voted
ECAI
2008
Springer
15 years 3 days ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
JAIR
2008
14 years 10 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...