Abstract
Reasoning about time is a very ancient discipline, perhaps as old as prehistoric man. These ancient humans had discovered how long to roast their hunted meat and how to dry and age the skins of animals. They learned how and when to plant seeds, and were guided by the cycles of the sun, moon and the seasons. Our ancestors knew that day followed night and night followed day, and they had some notion of duration of day and night. This basic temporal knowledge was exploited to develop a sense of planning, taking advantage of observation and experience. For example, they would have observed that deer drink at the river at a certain time of the day, or that .sh are easier to catch in the early morning. Early humans could recognize the changing seasons, and adapted their behavior in order to expect and avoid some of the dangers of cold and hunger by preparing in advance.
This paper was written in honor of Jean-Louis Lassez with whom the author has often engaged in discussion on reasoning about time, and was supported in part by the IRST Trento – CRI Haifa Cooperation Project.
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
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26, 832–843 (1983)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980); Annals of Discrete Mathematics, 2nd edn., vol. 57. Elsevier, Amsterdam (2004)
Golumbic, M.C.: Reasoning about time. In: Hoffman, F. (ed.) Mathematical Aspects of Artificial Intelligence. Proc. Symposia in Applied Math, vol. 55, pp. 19–53. American Math. Society (1998)
Golumbic, M.C.: Algorithmic graph theory and its applications. In: Golumbic, M.C., Ben-Arroyo Hartman, I. (eds.) Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications. Kluwer Academic, Dordrecht (2005)
Golumbic, M.C., Shamir, R.: Complexity and algorithms for reasoning about time: a graph-theoretic approach. J. Assoc. Comput. Mach. 40, 1108–1133 (1993)
Golumbic, M.C., Trenk, A.N.: Tolerance Graphs. Cambridge University Press, Cambridge (2004)
Meiri, I.: Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence 87, 343–385 (1996)
Nebel, B., Bürckert, H.-J.: Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra. J. ACM 42, 43–66 (1995)
VanBeek, P.: Reasoning about qualitative information. Artificial Intelligence 58, 297–326 (1992)
VanBeek, P., Cohen, R.: Exact and approximate reasoning about temporal relations. Computational Intelligence 6, 132–144 (1990)
Vilain, M., Kautz, H.: Constraint propagation algorithms for temporal reasoning. In: Proc. AAAI 1986, Philadelphia, PA, pp. 377–382 (1986)
Webber, A.B.: Proof of the interval satisfiability conjecture. Annals of Mathematics and Artificial Intelligence 15, 231–238 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golumbic, M.C. (2004). Graph Theoretic Models for Reasoning About Time. In: Maher, M.J. (eds) Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making. ASIAN 2004. Lecture Notes in Computer Science, vol 3321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30502-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-30502-6_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24087-7
Online ISBN: 978-3-540-30502-6
eBook Packages: Computer ScienceComputer Science (R0)