Sciweavers

JAIR
2008
99views more  JAIR 2008»
14 years 13 days ago
The Complexity of Planning Problems With Simple Causal Graphs
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...
Omer Giménez, Anders Jonsson
AIPS
2007
14 years 2 months ago
On the Hardness of Planning Problems with Simple Causal Graphs
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...
Omer Giménez, Anders Jonsson