Abstract
Allen's interval algebra has recently been under serious theoretical investigation for the purpose of identifying interesting sub-algebras within it. In this paper we have explored two mutually exclusive sub-algebras of Allen's interval algebra, which bear some physical significance. One of them is attached to the causal aspect of the temporal information, while the other one is related to simple containment of temporal relations. We are currently developing some algorithms for checking consistency by isolating these subsets from a given temporal constraint network. In this paper we have proposed such an algorithm and have discussed the significance of the availability of these two sub-algebras.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. F. Allen. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM 26: 510–521.
C. Freksa. (1993). Temporal reasoning based on semi-intervals. Artificial Intelligence 54: 199–227.
A. Gerivini & M. Christiani. (1995). Reasoning with inequations in temporal constraint networks. In Workshop note on Spatial and Temporal Reasoning, IJCAI-95.
J. Guidi and T. Roderick. (1993). Inference of order in genetic systems. In Proceedings of the International Conference on Intelligent Systems for Molecular Biology.
P. Haddaway. (1996). A logic of time, chance, and action for representing plans. Artificial Intelligence 80: 243–308.
J. Koomen. (1989). The TIMELOGIC Temporal Reasoning System. Technical Report, TR231, Computer Science Department, University of Rochester.
P. Ladkin. (1988). Satisfying first-order constraints about time intervals. In Proceedings of the Seventh National Conference on Artificial Intelligence.
P. Ladkin & A. Reinefield. (1992). Effective solution of qualitative interval constraint problems. Artificial Intelligence 57: 105–124.
I. Meiri. (1991). Combining qualitative and quantitative constraints in temporal reasoning. In Proceedings of the National Conference of Am. Asso. of Artificial Intelligence.
D. Mitra & R. Loganantharaj. (1991). Efficient exact algorithm for finding all consistent singleton labeled models. In Proceedings of IEEE Robotics and Automation conference, pages 1193–1196.
A. Montanarin & B. Pernici. (1993). Temporal reasoning. In A. Tansel et al, eds, Temporal Databases: theory, design and implementation, pages 534–562, The Benjamin/Cummings Publishing Co., Inc.
M. Ranynal & M. Singhal. (1996). Capturing causality in distributed systems. IEEE Computer, pages 49–56.
R. Rodriguez & F. Anger. (1995). Reasoning with unsynchronized clocks. In Proc. of workshop on Spatial and Temporal Reasoning, IJCAI-95.
P. van Beek. (1990). Exact and approximate reasoning about qualitative temporal relations. Ph.D. dissertation, University of Alberta, Edmonton, Canada.
L. Vila. (1994). A survey on temporal reasoning in artificial intelligence. AI Communications 7: 4–28.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mitra, D. Cluster Forming Interval Sub-Algebras. Constraints 3, 179–189 (1998). https://doi.org/10.1023/A:1009773610309
Issue Date:
DOI: https://doi.org/10.1023/A:1009773610309