Reasoning about partially ordered events

DOI10.1016/0004-3702(88)90087-2MaRDI QIDQ1263999zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Reasoning about qualitative temporal information
• On the computational complexity of temporal projection, planning, and plan validation
• Complexity and algorithms for reasoning about time
• Temporal reasoning based on semi-intervals
• scientific article; zbMATH DE number 1538060

Cites work

• scientific article; zbMATH DE number 3599517 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the representation and querying of sets of possible worlds
• Planning for conjunctive goals
• STRIPS: A new approach to the application of theorem proving to problem solving

Cited in

(16)

• Modeling a dynamic and uncertain world. I: Symbolic and probabilistic reasoning about change
• Reasoning about causality between distributed nonatomic events
• Temporal reasoning based on semi-intervals
• A unifying approach to temporal constraint reasoning
• The computational complexity of propositional STRIPS planning
• Solving infinite-domain CSPs using the patchwork property
• Complexity classification transfer for CSPs via algebraic products
• On the nature and role of modal truth criteria in planning
• Complexity, decidability and undecidability results for domain-independent planning
• Point algebras for temporal reasoning: Algorithms and complexity
• scientific article; zbMATH DE number 1538060 (Why is no real title available?)
• Qualitative and quantitative simulation: bridging the gap
• An initial study of time complexity in infinite-domain constraint satisfaction
• Partial Orders, Event Structures and Linear Strategies
• Querying temporal and spatial constraint networks in PTIME
• On the computational complexity of temporal projection, planning, and plan validation

This page was built for publication: Reasoning about partially ordered events

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263999)