Reasoning about partially ordered events

DOI10.1016/0004-3702(88)90087-2zbMath0688.68083OpenAlexW2086784214MaRDI QIDQ1263999

Mark Boddy, Thomas L. Dean

Publication date: 1988

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(88)90087-2

zbMATH Keywords

complexitytemporal reasoningdecision problemincomplete decision procedureProbabilistic decision procedurestemporal projection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Related Items

The computational complexity of propositional STRIPS planning ⋮ Qualitative and quantitative simulation: bridging the gap ⋮ On the nature and role of modal truth criteria in planning ⋮ Reasoning about causality between distributed nonatomic events ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ Temporal reasoning based on semi-intervals ⋮ An initial study of time complexity in infinite-domain constraint satisfaction ⋮ A unifying approach to temporal constraint reasoning ⋮ Querying temporal and spatial constraint networks in PTIME ⋮ Complexity, decidability and undecidability results for domain-independent planning ⋮ Modeling a dynamic and uncertain world. I: Symbolic and probabilistic reasoning about change ⋮ On the computational complexity of temporal projection, planning, and plan validation ⋮ Point algebras for temporal reasoning: Algorithms and complexity

Cites Work

• Planning for conjunctive goals
• On the representation and querying of sets of possible worlds
• STRIPS: A new approach to the application of theorem proving to problem solving
• Unnamed Item
• Unnamed Item