Abstract
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 language | English |
|---|---|
| Pages | 774-780 |
| Number of pages | 7 |
| State | Published - Oct 1990 |
| Externally published | Yes |
| Event | Proceedings of the 5th Jerusalem Conference on Information Technology - Jerusalem, Isr Duration: 22 Oct 1990 → 25 Oct 1990 |
Conference
| Conference | Proceedings of the 5th Jerusalem Conference on Information Technology |
|---|---|
| City | Jerusalem, Isr |
| Period | 22/10/90 → 25/10/90 |
ASJC Scopus subject areas
- General Engineering