Abstract
Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals when the precise topological relationship between them is unknown or only partially specified. This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics. The satisfiability, minimum labeling and all consistent solutions problems are considered for temporal (interval) data. Several versions are investigated by restricting the possible interval relationships yielding different complexity results. We show that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NP-Complete. On the positive side, we have obtained efficient algorithms for several restrictions of the problem. In the process, the interval graph sandwich problem is introduced, and is shown to be NP-complete. This problem is also important in molecular biology, where it arises in physical mapping of DNA material.
| Original language | English |
|---|---|
| Title of host publication | Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings |
| Editors | Danny Dolev, Michael Rodeh, Zvi Galil, Zvi Galil |
| Publisher | Springer Verlag |
| Pages | 32-42 |
| Number of pages | 11 |
| ISBN (Print) | 9783540555537 |
| State | Published - 1992 |
| Externally published | Yes |
| Event | Israel Symposium on the Theory of Computing and Systems, ISTCS 1992 - Haifa, Israel Duration: 27 May 1992 → 28 May 1992 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 601 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | Israel Symposium on the Theory of Computing and Systems, ISTCS 1992 |
|---|---|
| Country/Territory | Israel |
| City | Haifa |
| Period | 27/05/92 → 28/05/92 |
Bibliographical note
Funding Information:Helpful conversations with Fred Roberts and Peter Ladkin are gratefully acknowledged. The initial stage of this work was done while the first author was a visitor at the IBM T.J. Watson Research Center, Yorktown Heights, NY. The work of the second author was done while he visited DIMACS and RUTCOR, Rutgers University, NJ and was supported in part by AFOSR grants 89-0512 and 90-0008, and by NSF grant STC88-09648.
Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)