Title :
Probabilistic temporal interval networks
Author :
Ryabov, Vladimir ; Trudel, André
Author_Institution :
Jyvaskyla Univ., Finland
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.
Keywords :
computational complexity; constraint handling; constraint theory; knowledge representation; probability; temporal reasoning; uncertainty handling; constraint satisfaction problem; path consistency algorithm; probabilistic basic relations; probabilistic representation; probabilistic temporal interval networks; uncertain interval relations; Algebra; Algorithm design and analysis; Computer networks; Computer science; Constraint theory; Heuristic algorithms; Optimization methods; Possibility theory; Uncertainty; Writing;
Conference_Titel :
Temporal Representation and Reasoning, 2004. TIME 2004. Proceedings. 11th International Symposium on
Print_ISBN :
0-7695-2155-X
DOI :
10.1109/TIME.2004.1314421
