The design and experimental analysis of algorithms for temporal reasoning

Many applications-from planning and scheduling to problems in molecular biology-rely heavily on a temporal reasoning component. In this paper, we discuss the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's influential interval-based framework for representing temporal information. At the core of the system are algorithms for determining whether the temporal information is consistent, and, if so, finding one or more scenarios that are consistent with the temporal information. Two important algorithms for these tasks are a path consistency algorithm and a backtracking algorithm. For the path consistency algorithm, we develop techniques that can result in up to a ten-fold speedup over an already highly optimized implementation. For the backtracking algorithm, we develop variable and value ordering heuristics that are shown empirically to dramatically improve the performance of the algorithm. As well, we show that a previously suggested reformulation of the backtracking search problem can reduce the time and space requirements of the backtracking search. Taken together, the techniques we develop allow a temporal reasoning component to solve problems that are of practical size.

[1]  Peter van Beek,et al.  Exact and approximate reasoning about temporal relations 1 , 1990, Comput. Intell..

[2]  Bernard Nudel,et al.  Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics , 1983, Artif. Intell..

[3]  James F. Allen,et al.  Planning Using a Temporal World Model , 1983, IJCAI.

[4]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[5]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  Alexander Reinefeld,et al.  Effective Solution of Qualitative Interval Constraint Problems , 1992, Artif. Intell..

[8]  Bernard A. Nadel,et al.  Constraint satisfaction algorithms 1 , 1989, Comput. Intell..

[9]  Henry A. Kautz,et al.  Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.

[10]  Henry A. Kautz,et al.  Constraint propagation algorithms for temporal reasoning: a revised report , 1989 .

[11]  S. Benzer.  ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Paul Walton Purdom,et al.  Search Rearrangement Backtracking and Polynomial Average Time , 1983, Artif. Intell..

[13]  Peter van Beek,et al.  Reasoning About Qualitative Temporal Information , 1990, Artif. Intell..

[14]  Ron Shamir,et al.  Complexity and algorithms for reasoning about time: a graph-theoretic approach , 1993, JACM.

[15]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[16]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

[17]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[18]  Michael C. Frank,et al.  Search Lessons Learned from Crossword Puzzles , 1990, AAAI.

[19]  Bertram C. Bruce.  A Model for Temporal References and Its Application in a Question Answering Program , 1972, Artif. Intell..

[20]  John N. Hooker,et al.  Needed: An Empirical Science of Algorithms , 1994, Oper. Res..

[21]  Alexander Reinefeld,et al.  A Symbolic Approach to Interval Constraint Problems , 1992, AISMC.

[22]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[23]  Rina Dechter,et al.  From Local to Global Consistency , 1990, Artif. Intell..

[24]  Solomon W. Golomb,et al.  Backtrack Programming , 1965, JACM.

[25]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[26]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.