Temporal reasoning in Timegraph I–II

We describe two temporal reasoning systems called Timegraph I and II, which can efficiently manage large sets of relations in the Point Algebra as well as metric information. Our representation is based on timegraphs, graphs partitioned into a set of chains on which the search is supported by a metagraph data structure. Timegraph I was originally developed by Taugher, Schubert and Miller in the context of story comprehension. Timegraph II provides useful extensions which makes the system more expressive in the representation of qualitative information and suitable for a larger class of applications. Experimental results show that our approach is very efficient, especially when the given relations admit representation as a collection of chains connected by relatively few cross-chain links.

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

[2]  Chung Hee Hwang,et al.  An Episodic Knowledge Representation for Narrative Texts , 1989, KR.

[3]  Chung Hee Hwang,et al.  Meeting the Interlocking Needs of LF-Computation Deindexing and Inference: An Organic Approach to General NLU , 1993, IJCAI.

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

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

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

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

[8]  Henry A. Kautz,et al.  Integrating Metric and Qualitative Temporal Reasoning , 1991, AAAI.

[9]  James F. Allen,et al.  Performance of temporal reasoning systems , 1993, SGAR.

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

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

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

[14]  Ron Shamir,et al.  Algorithms and Complexity for Reasoning about Time , 1992, AAAI.

[15]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[16]  Malik Ghallab,et al.  Managing Efficiently Temporal Relations Through Indexed Spanning Trees , 1989, IJCAI.

[17]  Lenhart K. Schubert,et al.  The TRAINS Project , 1991 .

[18]  Jürgen Dorn,et al.  Temporal Reasoning in Sequence Graphs , 1992, AAAI.

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

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

[21]  Mark S. Boddy.  Temporal reasoning for planning and scheduling , 1993, SGAR.

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