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
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Efficient algorithms for qualitative reasoning about time
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
Graph Theory With Applications
Graph Theory With Applications
Managing efficiently temporal relations through indexed spanning trees
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Point-based approaches to qualitative temporal reasoning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A comparison of point-based approaches to qualitative temporal reasoning
Artificial Intelligence
Eight maximal tractable subclasses of Allen's algebra with metric time
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
It has been observed that the temporal reasoning component in a knowledge-based system is frequently a bottleneck. We investigate here a class of graphs appropriate for an interesting class of temporal domains and for which very efficient algorithms for reasoning are obtained, that of series-parallel graphs. These graphs can be used for example to model process execution, as well as various planning or scheduling activities. Events are represented by nodes of a graph and relationships are represented by edges labeled by ≤ or O(n) time pre-processing algorithm that allows us to answer queries about the events in O(1) time. Our results make use of a novel embedding of the graphs on the plane that is of independent interest. Finally we argue that these results may be incorporated in general graphs representing temporal events by extending the approach of Gerevini and Schubert.