Abstract
Many applications such as planning, scheduling, computational linguistics and computational models for molecular biology involve systems capable of managing qualitative and metric time information. An important issue in designing such systems is the efficient handling of temporal information in an evolutive environment. In a previous work, we have developed a temporal model, TemPro, based on the interval algebra, to express such information in terms of qualitative and quantitative temporal constraints. In order to find a good policy for solving time constraints in a dynamic environment, we present in this paper, a study of dynamic arc-consistency algorithms in the case of temporal constraints. We show that, an adaptation of the new AC-3 algorithm presents promising results comparing to the other dynamic arc-consistency algorithms. Indeed, while keeping an optimal worst-case time complexity, this algorithm has a better space complexity than the other methods.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.F. Allen. Maintaining knowledge about temporal intervals. CACM, 26(11):832–843, 1983.
C. Bessière. Arc-consistency in dynamic constraint satisfaction problems. In AAAI’91, pages 221–226, Anaheim, CA, 1991.
C. Bessière. Arc-consistency and arc-consistency again. Artificial Intelligence, 65:179–190, 1994.
C. Bessière and J. C. Régin. Refining the basic constraint propagation algorithm. In Seventeenth International Joint Conference on Artificial Intelligence (IJCAI’01), pages 309–315, Seattle, WA, 2001.
D. Chapman. Planning for conjunctive goals. Artificial Intelligence., 32:333–377, 1987.
R. Debruyne. Les algorithmes d’arc-consistance dans les csp dynamiques. Revue d’Intelligence Artificielle, 9:239–267, 1995.
R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61–95, 1991.
C. Golumbic and R. Shamir. Complexity and algorithms for reasoning about time: a graphic-theoretic approach. Journal of the Association for Computing Machinery, 40(5):1108–1133, 1993.
C. Hwang and L. Shubert. Interpreting tense, aspect, and time adverbials: a compositional, unified approach. In Proceedings of the first International Conference on Temporal Logic, LNAI, vol 827, pages 237–264, Berlin, 1994.
A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.
A. K. Mackworth and E. Freuder. The complexity of some polynomial network-consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25:65–74, 1985.
R. Mohr and T. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:225–233, 1986.
M. Mouhoub, F. Charpillet, and J.P. Haton. Experimental analysis of numeric and symbolic constraint satisfaction techniques for temporal reasoning. Constraints: An International Journal, 2:151–164, Kluwer Academic Publishers, 1998.
B. Neuveu and P. Berlandier. Arc-consistency for dynamic constraint satisfaction problems: An rms free approach. In ECAI-94, Workshop on Constraint Satisfaction Issues Raised by Practical Applications, Amsterdam, 1994.
M. Orgun. On temporal deductive databases. Computational Intelligence, 12(2):235–259, 1996.
J. Penberthy and d. Weld. Ucpop: A sound, complete, partial order planner for adl. In B. Nebel, C Rich, and W. Swartout, editors, Third International Conference on Principles of Knowledge Reprentation and Reasoning (KR’92), pages 103–114, Boston, MA, 1992.
J. Penberthy and d. Weld. Temporal planning with continuous change. In B. Nebel, C Rich, and W. Swartout, editors, Twelfth National Conference of the American Association for Artificial Intelligence (AAAI-94), pages 1010–1015, Seattle, WA, 1994.
F. Song and R. Cohen. Tense interpretation in the context of narrative. In AAAI’91, pages 131–136, 1991.
R. J. Wallace. Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs. In IJCAI’93, pages 239–245, Chambery, France, 1993.
Yuanlin Zhang and Roland H. C. Yap. Making ac-3 an optimal algorithm. In Seventeenth International Joint Conference on Artificial Intelligence (IJCAI’01), pages 316–321, Seattle, WA, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mouhoub, M., Yip, J. (2002). Dynamic CSPs for Interval-Based Temporal Reasoning. In: Hendtlass, T., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2002. Lecture Notes in Computer Science(), vol 2358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48035-8_56
Download citation
DOI: https://doi.org/10.1007/3-540-48035-8_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43781-9
Online ISBN: 978-3-540-48035-8
eBook Packages: Springer Book Archive