A General Qualitative Framework for Temporal and Spatial Reasoning

Authors:
Jean-François Condotta
Affiliations:
Centre de Recherche en Informatique de Lens, Université d'Artois, Rue Jean Souvraz, SP18, F-63307 Lens Cedex, France condotta@cril.univ-artois.fr
Venue:
Constraints
Year:
2004

Citing 12
Cited 1

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Exact and approximate reasoning about temporal relations

Computational Intelligence
Temporally distributed symptoms in technical diagnosis

Temporally distributed symptoms in technical diagnosis
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Reasoning about qualitative temporal information

Artificial Intelligence - Special volume on constraint-based reasoning
Exact and approximate reasoning about qualitative temporal relations

Exact and approximate reasoning about qualitative temporal relations
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals

Communications of the ACM
A New Tractable Subclass of the Rectangle Algebra

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Reasoning with sequences of point events

TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
A new proof of tractability for 0RD-horn relations

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

GNet: A generalized network model and its applications in qualitative spatial reasoning

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

To offer a generic framework which groups together several interval algebra generalizations, we simply define a generalized interval as a tuple of intervals. An atomic relation between two generalized intervals is a matrix of atomic relations of Interval Algebra. After introducing the generalized relations we focus on the consistency problem of generalized constraint networks and we present sets of generalized relations for which this problem is tractable, in particular the set of the strongly-preconvex relations.