Abstract
We consider a semi-dynamic setting for the Temporal Constraint Satisfaction Problem, where we are requested to maintain the path-consistency of a network under a sequence of insertions of new (further) constraints between pairs of variables. We show how to maintain path-consistent a network in the defined setting in O(nR 3) amortized time on a sequence of Θ(n2) insertions, where n is the number of vertices of the network and R is its range, defined as the maximum size of the minimum interval containing all the intervals of a single constraint. Furthermore we extend our algorithms to deal with more general temporal networks where variables can be points and/or intervals and constraints can be also defined on pairs of variables of different kind. For such cases our algorithms maintain their performance. Finally we adapt our algorithms for maintaining also the arc-consistency of such general networks, which is a particular kind of path-consistency limited to paths of length 1. The property is maintained in O(R) amortized time for Θ(n 2) insertions. In case of constraints consisting of simple intervals the algorithm also gives a solution to the satisfaction problem.
Work supported by the EU ESPRIT LTR Project “ALCOM-IT” under contract n. 20244 and by the Italian MURST National Project “Efficienza di Algoritmi e Progetto di Strutture Informative”.
Preview
Unable to display preview. Download preview PDF.
References
J.F. Allen. Maintaining knowledge about temporal intervals. Communication of the ACM, 26(11), 1983.
F.D. Anger and R.V. Rodriguez. Effective scheduling of tasks under weak temporal interval constraints. Lecture Notes in Computer Science, 945, 1995.
J. Carmo and A. Sernadas. A temporal logic framework for a layered approach to systems specification and verification. In Proceedings of the Conference on Temporal Aspects in Information Systems, pages 31–47, France, May 1987. AFCET.
R. Cervoni, A. Cesta, and A. Oddi. Managing dynamic temporal constraint networks. In Proceedings of AIPS '94, 1994.
E. Davis, 1989. Private communication reported in [6].
R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49, 1991.
E.C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29, 1982.
C.-C. Han and C.H. Lee. Comments on Mohr and Hendersons path consistency algorithms. Artificial Intelligence, 36, 1988.
C.-C. Han, K.-J. Lin, and J.W.-S. Liu. Scheduling jobs with temporal distance constraints. SIAM Journal on Computing, 24(5):1104–1121, 1995.
A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8, 1977.
Z. Manna and A. Pnueli. Verification of concurrent programs: Temporal proof principle. In D. Kozen, editor, Logics of Programs (Proceedings 1981), LNCS 131, pages 200–252. Springer-Verlag, 1981.
Z. Manna and A. Pnueli. Verification of concurrent programs: the temporal framework. In R.S. Boyer and J.S. Moore, editors, The Correctness Problem in Computer Science, pages 215–273. Academic Press, 1981.
I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. In Proc. of the 10th National Conference of the American Association for Artificial Intelligence (AAAI '91), 1991.
U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7, 1974.
B. Nebel and H.J. Biirckert. Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42, 1995.
H. Noltemeier and G. Schmitt. Incremental temporal constraint propagation. In Proc. of the 9th Florida Artificial Intelligence Research Symp. (FLAIRS '96), pages 25–29, 1996.
J.S. Ostroff. Temporal Logic of Real-Time Systems. Research Studies Press, 1990.
A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors. Temporal Databases: Theory, Design, and Implementation. Database Systems and Applications Series. Benjamin/Cummings, Redwood City, CA, 1993.
R.E. Tarjan. Amortized computational complexity. SIAM J. Algebraic Discrete Methods, 6(2):306–318, 1985.
P. van Beek. Reasoning about qualitative temporal information. Artificial intelligence, 58, 1992.
M. Vilain and H.A. Kautz. Constraint propagation algorithms for temporal reasoning. In Proc. of the 5th National Conference of the American Association for Artificial Intelligence (AAAI '86), 1986.
M. Vilain, H.A. Kautz, and P. van Beek. Constraint propagation algorithms for temporal reasoning: a revised report. In D.S. Weld and J. de Kleer, editors, Readings in qualitative reasoning about physical systems. Morgan Kaufman, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
d'Amore, F., Iacobini, F. (1997). On-line algorithms for networks of temporal constraints. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024495
Download citation
DOI: https://doi.org/10.1007/BFb0024495
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63757-8
Online ISBN: 978-3-540-69643-8
eBook Packages: Springer Book Archive