论文信息 - Interval Algebra Networks with Infinite Intervals

Interval Algebra Networks with Infinite Intervals

Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infinite. We then show how algorithms developed for solving interval algebra networks with finite intervals can be used, with minor modifications, in the infinite case.

André Trudel | A. Trudel

[1] Jerry R. Hobbs,et al. An ontology of time for the semantic web , 2004, TALIP.

[2] Marianne Baudinet,et al. On the representation of infinite temporal data and queries (extended abstract) , 1991, PODS '91.

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

[4] Peter van Beek,et al. The Design and Experimental Analysis of Algorithms for Temporal Reasoning , 1995, J. Artif. Intell. Res..

[5] Peter B. Ladkin,et al. Simple Reasoning with Time-Dependent Propositions , 2002, Log. J. IGPL.

[6] James P. Delgrande,et al. A Theory for Convex Interval Relations including Unbounded Intervals , 2004, FLAIRS.

[7] James F. Allen. Towards a General Theory of Action and Time , 1984, Artif. Intell..

[8] Peter van Beek,et al. The design and experimental analysis of algorithms for temporal reasoning , 1996 .

[9] Manolis Koubarakis,et al. Database models for infinite and indefinite temporal information , 1994, Inf. Syst..

[10] Pierre Wolper,et al. Handling Infinite Temporal Data , 1995, J. Comput. Syst. Sci..