Introduction to algorithms
Computational Intelligence
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations
Computational Intelligence
Artificial Intelligence - Special issue on knowledge representation
Maintaining knowledge about temporal intervals
Communications of the ACM
A simple way to improve path consistency processing in interval algebra networks
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Temporal representation and reasoning in artificial intelligence: A review
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
In this paper we address the problem of scalability in temporal reasoning. In particular, new algorithms for efficiently managing large sets of relations in the Point Algebra are provided. Our representation of time is based on timegraphs, graphs partitioned into a set of chains on which the search is supported by a metagraph data structure. The approach is an extension of the time representation proposed by Schubert, Taugher and Miller in the context of story comprehension. The algorithms presented in this work concern the construction of a timegraph from a given set of relations and are implemented in a temporal reasoning system called TG-II. Experimental results show that our approach is very efficient, especially when the given relations admit representation as a collection of chains connected by relatively few cross-chain links.