# 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

#### Topics from this paper

#### 237 Citations

Point algebras for temporal reasoning: Algorithms and complexity

- Mathematics, Computer Science
- Artif. Intell.
- 2003

Computational Complexity of Relating Time Points with Intervals

- Mathematics, Computer Science
- Artif. Intell.
- 1999

Satisfiability Problems on Intervals and Unit Intervals

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1997

Interval Graphs, Interval Orders and the Consistency of Temporal Events

- Mathematics, Computer Science
- ISTCS
- 1992

Modelling and solving temporal reasoning as propositional satisfiability

- Mathematics, Computer Science
- Artif. Intell.
- 2008

Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints

- Computer Science
- AISC
- 2002

#### References

SHOWING 1-4 OF 4 REFERENCES

The algebra of constraint satisfaction problems and temporal reasoning.

- 1988

Maintaining knowledge about temporal intervals." Comm

- 1983

On the topology of the genetic ne structure.

- Proc. Nat. Acad. Sci. USA
- 1959