Backtracking algorithms for disjunctions of temporal constraints

摘要: We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints form x1 - y1 ? r1 V... V xn yn rn where x1... xn, y1... are variables ranging over real numbers, r1... constants, n 1. have implemented four progressively more efficient algorithms for consistency checking problem this class constraints. partially ordered those according number visited search nodes performed checks. Finally, we carried out a series experimental results on location hard region. The show that occur at critical value ratio disjunctions variables. This is between 6 7.