Point-Based Approaches to Qualitative Temporal Reasoning
Abstract
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.
Cite
Text
Delgrande et al. "Point-Based Approaches to Qualitative Temporal Reasoning." AAAI Conference on Artificial Intelligence, 1999.Markdown
[Delgrande et al. "Point-Based Approaches to Qualitative Temporal Reasoning." AAAI Conference on Artificial Intelligence, 1999.](https://mlanthology.org/aaai/1999/delgrande1999aaai-point/)BibTeX
@inproceedings{delgrande1999aaai-point,
title = {{Point-Based Approaches to Qualitative Temporal Reasoning}},
author = {Delgrande, James P. and Gupta, Arvind and Van Allen, Tim},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1999},
pages = {739-744},
url = {https://mlanthology.org/aaai/1999/delgrande1999aaai-point/}
}