Reasoning about generalized intervals: Horn representabilityand tractability - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Conference Papers Year : 2002

Reasoning about generalized intervals: Horn representabilityand tractability


This paper organizes the topologic forms of the possible relations between generalized intervals. Working out generalized interval algebra on the pattern of point algebra and interval algebra, it introduces the concept of Horn representability just as the one of convexity. It gives the class of Horn representable relations a simple characterization based on the concept of strong preconvexity. Adapting the propagation techniques designed to solve the networks of constraints between points or between intervals, it shows that the issue of consistency of a Horn representable generalized interval network can be solved in polynomial time by means of the weak path-consistency algorithm, a new incomplete algorithm for computing a minimal set of temporal constraints.
Fichier principal
Vignette du fichier
Reasoning about generalized intervals_Horn representabilityand tractability.pdf (436.65 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

hal-04006716 , version 1 (28-02-2023)



Philippe Balbiani, Jean-François Condotta, Gerard Ligozat. Reasoning about generalized intervals: Horn representabilityand tractability. 7th International Workshop on Temporal Representation and Reasoning (TIME 2000), Jul 2000, Cape Breton, NS, Canada. pp.23--39, ⟨10.1109/TIME.2000.856580⟩. ⟨hal-04006716⟩
38 View
27 Download



Gmail Mastodon Facebook X LinkedIn More