Algorithms and Complexity for Reasoning about Time

Interval consistency problems deal with events, each of which is assumed to be an interval on the real line or on any other linearly ordered set. This paper deals with problems in reasoning about such intervals when the precise topological relationships between them is unknown or only partially specified. This work unifies notions of interval algebras for temporal reasoning in artificial intelligence with those of interval orders and interval graphs in combinatorics, obtaining new algorithmic and complexity results of interest to both disciplines. Several versions of the satisjiability, minimum labeling and all consistent solutions problems for temporal (interval) data are investigated. The satisfiability question is shown to be NP-complete even when restricting the possible interval relationships to subsets of the relations intersection and precedence only. On the other hand, we give efficient algorithm for several other restrictions of the problem. Many of these problems are also important in molecular biology, archaeology, and resolving mutual-exclusion constraints in circuit design.

[1]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[2]  Martin Charles Golumbic,et al.  Counting endpoint interval orders and , 2001 .

[3]  David G. Kendall,et al.  Some problems and methods in statistical archaeology , 1969 .

[4]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[5]  Rolf H. Möhring,et al.  An Incremental Linear-Time Algorithm for Recognizing Interval Graphs , 1989, SIAM J. Comput..

[6]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[7]  Ben Dushnik,et al.  Partially Ordered Sets , 1941 .

[8]  Nimrod Megiddo,et al.  Towards a Genuinely Polynomial Algorithm for Linear Programming , 1983, SIAM J. Comput..

[9]  S. Benzer.  ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Henry A. Kautz,et al.  Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.

[11]  Robert H. Halstead,et al.  Computation structures , 1990, MIT electrical engineering and computer science series.

[12]  Peter van Beek,et al.  Reasoning About Qualitative Temporal Information , 1990, Artif. Intell..

[13]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[14]  Peter C. Fishburn,et al.  Partial orders of dimension 2 , 1972, Networks.

[15]  Martin Charles Golumbic.  Interval graphs and related topics , 1985, Discret. Math..

[16]  Peter van Beek,et al.  Approximation Algorithms for Temporal Reasoning , 1989, IJCAI.

[17]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[18]  D. Kendall.  Incidence matrices, interval graphs and seriation in archeology. , 1969 .

[19]  P. Fishburn.  Intransitive indifference with unequal indifference intervals , 1970 .

[20]  Mihalis Yannakakis,et al.  Scheduling Interval-Ordered Tasks , 1979, SIAM J. Comput..

[21]  Martin Charles Golumbic,et al.  A combinatorial approach to temporal reasoning , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.

[22]  Wen-Lian Hsu,et al.  Recognizing circle graphs in polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[23]  Clyde H. Coombs,et al.  On the detection of structure in attitudes and developmental processes. , 1973 .

[24]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[25]  Joseph Naor,et al.  Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality , 1994, SIAM J. Comput..

[26]  Ron Shamir,et al.  Complexity and algorithms for reasoning about time: a graph-theoretic approach , 1993, JACM.

[27]  André Bouchet,et al.  Reducing prime graphs and recognizing circle graphs , 1987, Comb..

[28]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..