On the computational complexity of temporal projection, planning, and plan validation
From MaRDI portal
Publication:1321058
DOI10.1016/0004-3702(94)90005-1zbMath0803.68122MaRDI QIDQ1321058
Christer Bäckström, Bernhard Nebel
Publication date: 2 January 1995
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(94)90005-1
68Q25: Analysis of algorithms and problem complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Planning for conjunctive goals
- On the complexity of blocks-world planning
- Reasoning about partially ordered events
- An empirical analysis of terminological representation systems
- The computational complexity of propositional STRIPS planning
- Complexity, decidability and undecidability results for domain-independent planning
- STRIPS: A new approach to the application of theorem proving to problem solving