Temporal Reasoning without Transitive Tables

Simple item page
dc.creatorSchwer, Sylviane R.
dc.date2007-06-09
dc.date.accessioned2026-07-07T08:04:47Z
dc.date.available2026-07-07T08:04:47Z
dc.descriptionRepresenting 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.
dc.descriptionrapport interne
dc.identifierhttps://arxiv.org/abs/0706.1290
dc.identifierhttp://arxiv.org/abs/0706.1290
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130093
dc.subjectArtificial Intelligence
dc.subjectF.4.3
dc.titleTemporal Reasoning without Transitive Tables
dc.typetext

Files

Collections

arXiv