Complexity and algorithms for reasoning about time: a graph-theoretic approach

@article{Golumbic1993ComplexityAA,
  title={Complexity and algorithms for reasoning about time: a graph-theoretic approach},
  author={M. Golumbic and R. Shamir},
  journal={J. ACM},
  year={1993},
  volume={40},
  pages={1108-1133}
}
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, minimal labeling, all solutions, and all realizations problems are considered for temporal (internal) data… Expand
Algorithms and Complexity for Reasoning about Time
Point algebras for temporal reasoning: Algorithms and complexity
Trends in Temporal Reasoning: Constraints, Graphs and Posets
Computational Complexity of Relating Time Points with Intervals
Satisfiability Problems on Intervals and Unit Intervals
Interval Graphs, Interval Orders and the Consistency of Temporal Events
Modelling and solving temporal reasoning as propositional satisfiability
A Representation for Efficient Temporal Reasoning
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
The algebra of constraint satisfaction problems and temporal reasoning.
  • 1988
Maintaining knowledge about temporal intervals." Comm
  • 1983
Algorithmic graph theory and perfect graphs
On the topology of the genetic ne structure.
  • Proc. Nat. Acad. Sci. USA
  • 1959