DMCA
Disjunctive Temporal Reasoning in Partially Ordered Models of Time (2000)
| Venue: | In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000 |
| Citations: | 4 - 4 self |
BibTeX
@INPROCEEDINGS{Broxvall00disjunctivetemporal,
author = {Mathias Broxvall and Peter Jonsson},
title = {Disjunctive Temporal Reasoning in Partially Ordered Models of Time},
booktitle = {In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000},
year = {2000},
pages = {464--469},
publisher = {AAAI Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Certain problems in connection with, for example, cooperating agents and distributed systems require reasoning about time which is measured on incomparable or unsynchronized time scales. In such situations, it is sometimes approporiate to use a temporal model that only provides a partial order on time points. We study the computational complexity of partially ordered temporal reasoning in expressive formalisms consisting of point algebras extended with disjunctions. We show that the resulting algebra for partially ordered time contains four maximal tractable subclasses while the equivalent algebra for total-ordered time contains two. Keywords: Temporal reasoning, constraint satisfaction, computational complexity. Introduction Many problems in Artificial Intelligence includes temporal reasoning in some form. Research on temporal reasoning has mainly focused on linear models of time, cf. Allen (1983). However, it is clear that more complex time models are needed in a variety...
Keyphrases
temporal reasoning disjunctive temporal reasoning partially ordered model computational complexity introduction many problem ordered time total-ordered time certain problem temporal model ordered temporal reasoning equivalent algebra distributed system point algebra artificial intelligence linear model complex time model constraint satisfaction unsynchronized time scale partial order maximal tractable subclass expressive formalism time point
