Constraint Propagation Algorithms for Temporal Reasoning

This talk considers computational aspects of interval-based and point-based reified temporal algebras. In these algebras, intervals or moments of time are represented by terms. Assertions take the form of constraints between pairs of terms, where each constraint is a disjunction of basic temporal predicates. For example, the fact that intervals A and B are disjoint is represented by the assertion A (before OR meet OR met-by OR after ) B.