Causal graphs and structurally restricted planning

DOI10.1016/j.jcss.2009.10.013zbMath1197.68069OpenAlexW2011653008MaRDI QIDQ988572

Omer Giménez, Hubie Chen

Publication date: 18 August 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.10.013

zbMATH Keywords

classificationcomplexityplanningcausal graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs ⋮ Backdoors to planning ⋮ Red-black planning: a new systematic approach to partial delete relaxation ⋮ A complete parameterized complexity analysis of bounded planning

Cites Work

• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Tractable plan existence does not imply tractable plan generation
• Automatically generating abstractions for planning
• The computational complexity of propositional STRIPS planning
• A comparison of structural CSP decomposition methods
• Parametrized complexity theory.
• Non-dichotomies in Constraint Satisfaction Complexity
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Causal graphs and structurally restricted planning