Granularity in relational formalisms with application to time and space representation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Computational Intelligence Année : 2001

Granularity in relational formalisms with application to time and space representation

Résumé

Temporal and spatial phenomena can be seen at a more or less precise granularity, depending on the kind of perceivable details. As a consequence, the relationship between two objects may differ depending on the granularity considered. When merging representations of different granularity, this may raise problems. This paper presents general rules of granularity conversion in relation algebras. Granularity is considered independently of the specific relation algebra, by investigating operators for converting a representation from one granularity to another and presenting six constraints that they must satisfy. The constraints are shown to be independent and consistent and general results about the existence of such operators are provided. The constraints are used to generate the unique pairs of operators for converting qualitative temporal relationships (upward and downward) from one granularity to another. Then two fundamental constructors (product and weakening) are presented: they permit the generation of new qualitative systems (e.g. space algebra) from existing ones. They are shown to preserve most of the properties of granularity conversion operators.
Fichier principal
Vignette du fichier
euzenat2001g.pdf (218.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00822915 , version 1 (15-05-2013)

Identifiants

Citer

Jérôme Euzenat. Granularity in relational formalisms with application to time and space representation. Computational Intelligence, 2001, 17 (4), pp.703-737. ⟨10.1111/0824-7935.00170⟩. ⟨hal-00822915⟩
103 Consultations
149 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More