Reasoning about generalized intervals : Horn representability and tractability - Archive ouverte HAL Access content directly
Conference Papers Year : 2000

Reasoning about generalized intervals : Horn representability and tractability

(1) , (2) , (3, 4)
1
2
3
4

Abstract

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.

Dates and versions

hal-03300321 , version 1 (27-07-2021)

Identifiers

Cite

Philippe Balbiani, Jean-François Condotta, Gérard Ligozat. Reasoning about generalized intervals : Horn representability and tractability. 7th international workshop on Temporal Representation and Reasoning (TIME 2000), 2000, Unknown, Canada. pp.23-30, ⟨10.1109/TIME.2000.856580⟩. ⟨hal-03300321⟩
18 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More