Efficient Algorithms for Qualitative Reasoning about Time

@article{Gerevini1995EfficientAF,
  title={Efficient Algorithms for Qualitative Reasoning about Time},
  author={Alfonso Gerevini and Lenhart K. Schubert},
  journal={Artif. Intell.},
  year={1995},
  volume={74},
  pages={207-248}
}
Reasoning about temporal information is an important task in many areas of Artiicial Intelligence. In this paper we address the problem of scal-ability in temporal reasoning by providing a collection of new algorithms for eeciently managing large sets of qualitative temporal relations. We focus on the class of relations forming the Point Algebra (PA… CONTINUE READING