Limitations of acyclic causal graphs for planning
From MaRDI portal
Publication:490647
DOI10.1016/j.artint.2014.02.002zbMath1334.68201OpenAlexW2059882437MaRDI QIDQ490647
Anders Jonsson, Peter Jonsson, Tomas Lööw
Publication date: 27 August 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2014.02.002
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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tractable plan existence does not imply tractable plan generation
- Automatically generating abstractions for planning
- The computational complexity of propositional STRIPS planning
- Downward refinement and the efficiency of hierarchical problem solving
- A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond
- The Role of Macros in Tractable Planning