A combinatorial approach to temporal reasoning

Alexander Belfer, Martin Charles Golumbic

Research output: Contribution to conferencePaperpeer-review


It is described how representation structures for counting the number of endpoint sequences associated with a given interval order or interval graph can be used in temporal reasoning. Efficient algorithms for constructing such structures from temporal data are designed and analyzed. The endpoint sequence closure problem for temporal (interval) data is defined here as the problem of determining all possible interval representations consistent with the given data. The results demonstrate polynomial time solutions to several special cases of the endpoint sequence closure problem and suggest a number of directions for further research.

Original languageEnglish
Number of pages7
StatePublished - Oct 1990
Externally publishedYes
EventProceedings of the 5th Jerusalem Conference on Information Technology - Jerusalem, Isr
Duration: 22 Oct 199025 Oct 1990


ConferenceProceedings of the 5th Jerusalem Conference on Information Technology
CityJerusalem, Isr

ASJC Scopus subject areas

  • General Engineering

Cite this