Introduction to algorithms
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
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
A representation for efficient temporal reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A comparison of point-based approaches to qualitative temporal reasoning
Artificial Intelligence
Consistency Checking for Qualitative Spatial Reasoning with Cardinal Directions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On the consistency of cardinal direction constraints
Artificial Intelligence
On the consistency of cardinal direction constraints
Artificial Intelligence
| Hi-index | 0.00 |
We address the general problem of finding algorithms for efficient, qualitative, point-based temporal reasoning over a set of operations. We consider general reasoners tailored for temporal domains that exhibit a particular structure and introduce such a reasoner based on the series-parallel graph reasoner of Delgrande and Gupta; this reasoner is also an extension of the Time Graph reasoner of Gerevini and Schubert. Test results indicate that for data with underlying structure, our reasoner performs better than other approaches. When there is no underlying structure in the data, our reasoner still performs better for query answering.