The Community for Technology Leaders
RSS Icon
Subscribe
Alicante, Spain
June 28, 2007 to June 30, 2007
ISBN: 0-7695-2836-8
pp: 163-168
Jean-Francois Baget , INRIA Rhone-Alpes and LIG, France
Sebastien Laborie , INRIA Rhone-Alpes and LIG, France
ABSTRACT
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.
INDEX TERMS
null
CITATION
Jean-Francois Baget, Sebastien Laborie, "Bi-Intervals for Backtracking on Temporal Constraint Networks", TIME, 2007, Temporal Representation and Reasoning, International Syposium on, Temporal Representation and Reasoning, International Syposium on 2007, pp. 163-168, doi:10.1109/TIME.2007.44
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool