Abstract
Most of real AI applications developed under dynamic environments have to interact with the external world, deal with imprecision of data and make estimations about the possible data occurrence at different instants of time. A temporal model suitable for this type of domains must provide a representation framework able to capture external observations, update this information in the internal state application and deduce how these changes influence the application evolution. Reasoning processes for dynamic domains are generally quite complex due to the imprecision and variability of data. This usually leads to situations where the available time to update all the necessary information before processing the following change is not enough. When this occurs the internal model is not more consistent with the external world thus leading to dysfunctions in the system.
This paper presents a suitable temporal model for applications running under dynamic environments. The proposed framework allows to keep the world model consistent with the external world as well as the prediction of future consequences. All reasoning algorithms are designed as a search process between two time-points allowing to obtain approximate responses for a temporal query instead of optimal long time-consuming solutions.
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
Barber F.A. “A metric Time-point and Duration-Based Temporal model”. SIGARTACM Bulletin Vol.4, No.3, pp. 30–49 (1993) 208
Dean T.L., McDermott D.V. “Temporal Data Base Management”. Artificial Intelligence 32, pp. 1–55 (1987) 208
Dechter R., Meiri I., Pearl J. “Temporal constraints networks”. Artificial Intelligence 49, pp. 61–95 (1991) 208
Gerevini A., Schubert L. “Efficient algorithms for qualitative reasoning about time”. Artificial Intelligence 74(2), pp. 207–248. (1995) 208
Golumbic M.C., Shamir R. “Complexity and algorithms for reasoning about time: A graph-theoretic approach”. Journal of ACM Vol. 40, pp. 1108–1133 (1993) 208
Haddawy P. “Representing Plans Under Uncertainty. A logic of Time, Chance, and Action”. Lecture Notes in Artificial Intelligence. Springer-Verlag 770. (1994) 208
Hanks S., McDermott D. “Modeling a dynamic and uncertain world I: symbolic and probabilistic reasoning about change”. Artificial Intelligence 66, pp. 1–55. (1994) 208
Shoham Y.: “Reasoning about change”. MIT Press. (1988) 208
Van Beek P. “Reasoning about Qualitative Temporal Information”. Proc. AAAI-90, pp. 728–734, Boston, MA. (1990) 208
Yampratoon E., Allen J.F. “Performance of Temporal Reasoning Systems”. University of Rochester. Computer Science Department. TRAINS Technical Note 93-1. (May 1993) 208
Korf R.E. “Linear-space best-first search”. Artificial Intelligence 62, pp. 41–78. (1993) 217
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Onaindia, E., Rebollo, M. (1998). Temporal Representation and Reasoning for Dynamic Environments. In: Coelho, H. (eds) Progress in Artificial Intelligence — IBERAMIA 98. IBERAMIA 1998. Lecture Notes in Computer Science(), vol 1484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49795-1_18
Download citation
DOI: https://doi.org/10.1007/3-540-49795-1_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64992-2
Online ISBN: 978-3-540-49795-0
eBook Packages: Springer Book Archive