Temporal Representation and Reasoning, International Syposium on (2007)
June 28, 2007 to June 30, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2007.44
Jean-Francois Baget , INRIA Rhone-Alpes and LIG, France
Sebastien Laborie , INRIA Rhone-Alpes and LIG, France
Checking satisfiability of temporal constraint networks involves infinite variables domains. We explore a solution based upon finite partitions of infinite domains. Though a straightforward partition results in a sound and complete backtrack, its extension to forward checking is not complete. Using bi-intervals, we obtain sound and complete backtrack and forward checking algorithms. Moreover, we show that bi-intervals used in a hybrid algorithm which also instanti- ates constraints improve backtrack efficiency.
J. Baget and S. Laborie, "Bi-Intervals for Backtracking on Temporal Constraint Networks," Temporal Representation and Reasoning, International Syposium on(TIME), Alicante, Spain, 2007, pp. 163-168.