an:00146359
Zbl 0782.68106
van Beek, Peter
Reasoning about qualitative temporal information
EN
Artif. Intell. 58, No. 1-3, 297-326 (1992).
00010752
1992
j
68T15
temporal reasoning; interval algebra; point algebra; constraint satisfaction
Summary: Representing and reasoning about incomplete and indefinite qualitative temporal information is an essential part of many artificial intelligence tasks. An interval-based framework and a point-based framework have been proposed for representing such temporal information. We address two fundamental reasoning tasks that arise in applications of these frameworks: Given possibly indefinite and incomplete knowledge of the relationships between some intervals or points, (i) find a scenario that is consistent with the information provided, and (ii) find the feasible relations between all pairs of intervals or points.
For the point-based framework and a restricted version of the interval- based framework, we give computationally efficient procedures for finding a consistent scenario and for finding the feasible relations. Our algorithms are marked improvements over the previously known algorithms. In particular, we develop an \(O(n^ 2)\)-time algorithm for finding one consistent scenario that is an \(O(n)\) improvement over the previously known algorithm, where \(n\) is the number of intervals or points, and we develop an algorithm for finding all the feasible relations that is of far more practical use than the previously known algorithm. For the unrestricted version of the interval-based framework, finding a consistent scenario and finding the feasible relations have been shown to be NP-complete. We show how the results for the point algebra aid in the design of a backtracking algorithm for finding one consistent scenario that is shown to be useful in practice for planning problems.