On the computational complexity of temporal projection, planning, and plan validation

DOI10.1016/0004-3702(94)90005-1zbMath0803.68122OpenAlexW1990430111MaRDI QIDQ1321058

Bernhard Nebel, Christer Bäckström

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

zbMATH Keywords

planningtemporal reasoningtemporal projectionpartially ordered eventsplan validation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

On the nature and role of modal truth criteria in planning ⋮ On the complexity of case-based planning

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

This page was built for publication: On the computational complexity of temporal projection, planning, and plan validation