Computer Science – Artificial Intelligence
Scientific paper
2007-06-09
Computer Science
Artificial Intelligence
rapport interne
Scientific paper
Representing and reasoning about qualitative temporal information is an essential part of many artificial intelligence tasks. Lots of models have been proposed in the litterature for representing such temporal information. All derive from a point-based or an interval-based framework. One fundamental reasoning task that arises in applications of these frameworks is given by the following scheme: given possibly indefinite and incomplete knowledge of the binary relationships between some temporal objects, find the consistent scenarii between all these objects. All these models require transitive tables -- or similarly inference rules-- for solving such tasks. We have defined an alternative model, S-languages - to represent qualitative temporal information, based on the only two relations of \emph{precedence} and \emph{simultaneity}. In this paper, we show how this model enables to avoid transitive tables or inference rules to handle this kind of problem.
No associations
LandOfFree
Temporal Reasoning without Transitive Tables does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Temporal Reasoning without Transitive Tables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Temporal Reasoning without Transitive Tables will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-126351