2007/06/09 by Sylviane Schwer, Sylviane R. Schwer, Schwer, Sylviane R.
Computer Science · #Artificial Intelligence (cs.AI) #Constraint Satisfaction and Optimization #F.4.3 #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies #cs.AI
paper · pdf · doi:10.48550/arxiv.0706.1290
rapport interne
arxiv created 2007/06/09 · openalex publication_date 2007/06/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 precedence and simultaneity. In this paper, we show how this model enables to avoid transitive tables or inference rules to handle this kind of problem.