loading...
Probabilistic Temporal Interval Networks
Tatihou, Normandie, France July 01-July 03
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2004.131442111th International Symposium on Tempo ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Vladimir Ryabov, University of Jyv?skyl?
Andr? Trudel, Acadia University
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.
Citation:
Vladimir Ryabov, Andr? Trudel, "Probabilistic Temporal Interval Networks," time, pp.64-67, 11th International Symposium on Temporal Representation and Reasoning (TIME'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.