ON COMPUTING THE MINIMAL LABELS IN TIME POINT ALGEBRA NETWORKS

We analyze the problem of computing the minimal labels for a network of temporal relations in point algebra. Van Beek proposes an algorithm for accomplishing this task, which takes O(max(n3, n2 m)) time (for n points and m ≠‐relations). We show that the proof of the correctness of this algorithm given by van Beek and Cohen is faulty, and we provide a new proof showing that the algorithm is indeed correct.

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

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

[3]  Peter B. Ladkin,et al.  On binary constraint problems , 1994, JACM.

[4]  Lenhart K. Schubert,et al.  Efficient Algorithms for Qualitative Reasoning about Time , 1995, Artif. Intell..

[5]  Lenhart K. Schubert,et al.  Temporal reasoning in Timegraph I–II , 1993, SGAR.

[6]  Lenhart K. Schubert,et al.  Efficient Temporal Reasoning through Timegraphs , 1993, IJCAI.

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

[8]  Lenhart K. Schubert,et al.  Accelerating Deductive Inference: Special Methods for Taxonomies, Colours and Times , 1987 .

[9]  Peter B. Ladkin,et al.  On binary constraint networks , 1989 .

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

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

[12]  Lenhart K. Schubert,et al.  Determining Type, Part, Color, and Time Relationships , 1983, Computer.

[13]  Lenhart K. Schubert,et al.  Time revisited 1 , 1990, Comput. Intell..

[14]  Lenhart K. Schubert,et al.  The Temporal Reasoning Tools TimeGraph I-II , 1995, Int. J. Artif. Intell. Tools.

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

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