Causal graphs and structurally restricted planning
- 1 November 2010
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 76 (7) , 579-592
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Non-dichotomies in Constraint Satisfaction Complexity2008
- The Complexity of Planning Problems With Simple Causal GraphsJournal of Artificial Intelligence Research, 2008
- The complexity of homomorphism and constraint satisfaction problems seen from the other sideJournal of the ACM, 2007
- The Fast Downward Planning SystemJournal of Artificial Intelligence Research, 2006
- Structure and Complexity in Planning with Unary OperatorsJournal of Artificial Intelligence Research, 2003
- A comparison of structural CSP decomposition methodsArtificial Intelligence, 2000
- Tractable plan existence does not imply tractable plan generationAnnals of Mathematics and Artificial Intelligence, 1998
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- The computational complexity of propositional STRIPS planningArtificial Intelligence, 1994
- Automatically generating abstractions for planningArtificial Intelligence, 1994