Probabilistic Temporal Interval Networks

Authors:
Vladimir Ryabov;Andre Trudel
Affiliations:
University of Jyväskylä;Acadia University
Venue:
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Year:
2004

Citing 0
Cited 7

Retrieving the most probable solution in a temporal interval algebra network

EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
From data to text in the Neonatal Intensive Care Unit: Using NLG technology for decision support and information management

AI Communications
Conditional and composite temporal CSPs

Applied Intelligence
Finding a single, all, or the most probable solution to a finite or non-finite interval algebra network

AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Towards a possibility-theoretic approach to uncertainty in medical data interpretation for text generation

KR4HC'09 Proceedings of the 2009 AIME international conference on Knowledge Representation for Health-Care: data, Processes and Guidelines
Temporal Bayesian Knowledge Bases - Reasoning about uncertainty with temporal constraints

Expert Systems with Applications: An International Journal
Describing disease processes using a probabilistic logic of qualitative time

Artificial Intelligence in Medicine

Quantified Score

Hi-index	0.00

Visualization

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.