Abstract
3-consistency algorithm for temporal constraint propagation over interval-based network, proposed by James Allen, is finding its use in many practical temporal reasoning systems. Apart from the polynomial behavior of this algorithm with respect to the number of nodes in the network, very little is known about its time complexity with respect to other properties of the initially given temporal constraints. In this article we have reported some of our results analyzing the complexity with respect to some structural parameters of the input constraint network. We have identified some regions, with respect to the structural parameters of the input network, where the algorithm takes much more time than it needs over other regions. Similar features have been observed in recent studies on NP-hard problems. Average case complexity of Allen's algorithm is also studied empirically, over a hundred thousand randomly generated networks, and the growth rate is observed to be of the order of quadratic with respect to the problem size (at least up to node 40, and expected to be lower above that). We have analyzed our data statistically to develop a model with which one can calculate the expected time to be consumed by the algorithm for a given input network.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
J.F. Allen, “Maintaining knowledge about temporal intervals,” Communications of the ACM, vol. 26, no. 11, pp. 510–521, 1983.
P. van Beek, Ph.D. dissertation: Exact and Approximate Reasoning about Qualitative Temporal Relations, University of Alberta, Edmonton, Canada, 1990.
B. Bollobas, Random Graphs, Academic Press Inc. (London) Ltd., 1985.
P. Cheeseman, B. Kanefsky, and W.M. Taylor, “Where the really hard problems are,” in Proceedings of International Joint Conference on Artificial Intelligence, 1991, pp. 331–337.
I.J. Haimowitz and I.S. Kohane, “Automated trend detection with alternate temporal hypotheses,” in Proceedings of International Joint Conference on Artificial Intelligence, 1993, 1993.
R.V. Hogg and E.A. Tanis, “ Probability and Statistical Inference, Macmillan Publishing Company: New York, N.Y., 1983.
T. Hogg and C.P. Williams, “The hardest constraint problems: A double phase transition,” in Proceeding of National Conference on Artificial Intelligence, 1993.
B.A. Huberman and T. Hogg, “Phase transitions in artificial intelligence systems,” Artificial Intelligence, vol. 33, pp. 155–171, 1987.
S. Keretho and R. Loganantharaj, “Reasoning about networks of temporal relations and its applications to problem solving,” Journal of Applied Intelligence, vol. 3, pp. 47–70, 1993.
A. Johannes and G.M. Koomen, “The timelogic temporal reasoning system,” Technical report, TR231, Computer Science Department, University of Rochester, 1989.
P.B. Ladkin and A. Reinefield, “Effective solution of qualitative interval constraint problems,” Artificial Intelligence, vol. 57, pp. 105–124, 1992.
R. Loganantharaj and S. Keretho, “Efficient propagation algorithms for temporal interval algebra,” in Proceedings of the International Conference on Industrial and Engineering Application of Artificial Intelligence and Expert Systems, June 1991.
A. Chao-Chiang Meng and M. Sullivan, “Logos: A constraint-directed reasoning shell for operations management,” IEEE Expert, vol. 6, no. 1, 1991.
D. Mitchell, B. Seleman, and H. Levesque, “Hard and easy distributions of sat problems,” in Proceedings of the Tenth National Conference of Am. Asso. of Artificial Intelligence, 1992.
D. Mitra and R. Loganantharaj, “An efficient and approximate algorithm for temporal reasoning,” Technical Report TR93-2-2, Center for Advanced Computer Studies, University of SW Louisiana, 1993.
D. Mitra and R. Loganantharaj, “Some experimental works with 3-consistent temporal constraint propagation algorithm,” in IJCAI-93 Workshop on Spatial and Temporal Reasoning, 1993.
D. Mitra and R. Loganantharaj, “Weak-consistency in interval constraint network,” in Proceedings of AAAI-94 Workshop on Spatial and Temporal Reasoning, August 1994.
D. Mitra and N. Pal, “Some statistical studies of a hamiltonian circuit detection algorithm,” Technical Report TR93-2-4, Center for Advanced Computer Studies, University of SW Louisiana, 1993.
W.A. Perkins and A. Austin, “Adding temporal reasoning in expert-system-building environments,” IEEE Expert, vol. 5 no. 1, 1990.
N. Pissinou et al., “Research perspective on time in object databases,” ACM Sigmod Record (to appear), vol. 21, no. 3, 1993.
R. Rodriguez, F. Anger, and K. Ford, “Temporal reasoning: A relativistic model,” International Journal of Intelligent Systems, vol. 6, pp. 237–254, 1991.
R.C. Schank, “Where's the AI,” AI Magazine (AAAI), vol. 12, no. 4, pp. 38–49, 1991.
M. Vilain and H. Kautz, “Constraint propagation algorithms for temporal reasoning,” in Proceedings of National Conference of American Association of Artificial Intelligence, 1986, pp. 377–382.
Ed Yampratoom and J.F. Allen, “Performance of temporal reasoning systems,” Tech. Report: Computer Science Dept., Univ. of Rochester, TRAINS TN 93-1, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mitra, D., Loganantharaj, R. Experimenting with a temporal constraint propagation algorithm. Appl Intell 6, 39–48 (1996). https://doi.org/10.1007/BF00117600
Issue Date:
DOI: https://doi.org/10.1007/BF00117600