A comparison of point-based approaches to qualitative temporal reasoning

DOI10.1016/S0004-3702(01)00119-9MaRDI QIDQ1606329zbMATH OpenOpenAlexFDO

Authors James Delgrande, Tim Van Allen, Arvind Kumar Gupta

Publication date 24 July 2002

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0004-3702(01)00119-9

zbMATH Keywords

temporal reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Efficient algorithms for qualitative reasoning about time
• Temporal constraint networks
• On point-duration networks for temporal reasoning
• Reasoning about qualitative temporal information
• Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1149445 (Why is no real title available?)
• scientific article; zbMATH DE number 3359806 (Why is no real title available?)
• scientific article; zbMATH DE number 4185070 (Why is no real title available?)
• A circumscriptive calculus of events
• A comparison of point-based approaches to qualitative temporal reasoning
• A logic-based calculus of events
• Complexity and algorithms for reasoning about time
• Efficient algorithms for qualitative reasoning about time
• Graph theory with applications
• Maintaining knowledge about temporal intervals
• Reasoning about qualitative temporal information
• The Recognition of Series Parallel Digraphs
• The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse

Cited in

(8)

• On point-duration networks for temporal reasoning
• Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
• Reasoning about qualitative temporal information
• A comparison of point-based approaches to qualitative temporal reasoning
• Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
• Representation and compilation of knowledge in point-based temporal system
• Efficient algorithms for qualitative reasoning about time
• Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure

This page was built for publication: A comparison of point-based approaches to qualitative temporal reasoning

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