Abstract
A Probabilistic Temporal Interval Network is a constraint satisfaction problem where the nodes are temporal intervals and the edges are uncertain interval relations. We attach a probability to each of Allen?s basic interval relations. An uncertain relation between two temporal intervals is represented as a disjunction of Allen?s probabilistic basic relations. Using the operations of inversion, composition, and addition, defined for this probabilistic representation, we present a path consistency algorithm.