Abstract
The significance of representing duration information along with the qualitative information of the time intervals is well argued in the literature. A new framework INDu (INterval and DUration) network consisting of 25 basic relations, is proposed here. INDu can handle qualitative information of time interval and duration in one single structure. It inherits many interesting properties of Allen’s Interval Algebra (of 13 basic relations) but it also exhibits severed interesting additional features. We present several representations of INDu (ORD-clause, Geometric and Lattice) and characterise its tractable subclasses such as the Convex and Pre-convex classes. The important contribution of the current study is to show that for the tractable subclasses (Convex as well as Pre-convex) 4-consistency is necessary to guarantee global consistency of INDu-network.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Allen. Maintaining knowledge about temporal intervals. Communication of the ACM, 26(11):832–843, 1983.
F. Barber. A metric time-point and duration-based temporal model. SIGART Bulletin, 4(3):30–49, 1993.
C. D. Broad. Ostensible temporality. In G. M. Richard, editor, The Philosophy of Time: A collection of essays. Macmillan, 1968.
E.C. Freuder. A sufficient condition for backtrack-free search. Journal of ACM, 29:24–32, 1982.
M. Koubarakis. Dense time and temporal constraints with ≠. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), pages 24–35, 1992.
G. Ligozat. A new proof of tractability of ord-horn relations. In Proceedings of the 9th National Conference in Artificial Intelligence (AAAI-96), pages 395–401, Anaheim, CA, 1996.
G. Ligozat. “corner” relation in alien’s algebra. Constraints: An International Journal, 3:165–177, 1998.
I Navarrete and R. Marin. Qualitative temporal reasoning with points and durations. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 1454–1459, Nagoya, Japan, 1997.
B. Nebel and H. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of alien’s interval algebra. Journal of the ACM, 42(1):43–66, 1995.
Arun K. Pujari. Neighbourhood logic and interval algebra. Technical report, International Institute of Software Technology, United Nations University, Technical Report No 116, Macau, 1997.
Arun K. Pujari and A. Sattax. A new framework for reasoning about points, intervals and durations. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 1259–1264, 1999.
P. van Beek. Reasoning about qualitative temporal information. Artificial Intelligence, 58:297–326, 1992.
M. Vilain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proceedings of the 5th National Conference in Artificial Intelligence (AAAI-86), pages 377–382, Philadelphia, PA, 1986.
R. Wetprasit and A. Sattar. Temporal reasoning with qualitative and quantitative information about points and durations. In Proceeding of the 15th National Conference on Artificial Intelligence (AAAI-98), pages 656–663, Madison, Wisconsin, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pujari, A.K., Vijaya Kumari, G., Sattar, A. (1999). INDu: An Interval & Duration Network. In: Foo, N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science(), vol 1747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46695-9_25
Download citation
DOI: https://doi.org/10.1007/3-540-46695-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66822-0
Online ISBN: 978-3-540-46695-6
eBook Packages: Springer Book Archive