Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk)

Since Simple Temporal Networks (STNs) were first introduced in 1991, there have been numerous theoretic and algorithmic advances that have made them practical for a wide variety of applications. However, the presentation of most of the important advances have been scattered across numerous conference papers and journal articles. As a result, it is too easy for even experienced researchers to be unaware of results that could positively impact their work. In this talk we review the most important results about STNs for researchers in Artificial Intelligence who are interested in incorporating the management of time and temporal constraints into their projects. 2012 ACM Subject Classification Computing methodologies → Temporal reasoning; Theory of computation → Network optimization; Theory of computation → Dynamic graph algorithms; Mathematics of computing → Graph algorithms