Efficient Temporal Reasoning through Timegraphs

@inproceedings{Gerevini1993EfficientTR,
  title={Efficient Temporal Reasoning through Timegraphs},
  author={Alfonso Gerevini and Lenhart K. Schubert},
  booktitle={IJCAI},
  year={1993}
}
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 rnetagraph 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… CONTINUE READING