Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Conclusion
References

Temporal Data Modeling and Reasoning for Information Systems

Profile image of François BryFrançois Bry

2008

visibility

…

description

34 pages

link

1 file

Abstract

Abstract Temporal knowledge representation and reasoning is a major research field in Artificial Intelligence, in Database Systems, and in Web and Semantic Web research. The ability to model and process time and calendar data is essential for many applications like appointment scheduling, planning, Web services, temporal and active database systems, adaptive Web applications, and mobile computing applications. This article aims at three complementary goals.

Related papers

An Introduction to Constraint-Based Temporal Reasoning
Roman Bartak

Synthesis Lectures on Artificial Intelligence and Machine Learning, 2014

Solving challenging computational problems involving time has been a critical component in the development of artificial intelligence systems almost since the inception of the field. is book provides a concise introduction to the core computational elements of temporal reasoning for use in AI systems for planning and scheduling, as well as systems that extract temporal information from data. It presents a survey of temporal frameworks based on constraints, both qualitative and quantitative, as well as of major temporal consistency techniques. e book also introduces the reader to more recent extensions to the core model that allow AI systems to explicitly represent temporal preferences and temporal uncertainty. is book is intended for students and researchers interested in constraint-based temporal reasoning. It provides a self-contained guide to the different representations of time, as well as examples of recent applications of time in AI systems.

View PDFchevron_right
Temporal representation and reasoning
Carlo Combi

Data & Knowledge Engineering, 2003

View PDFchevron_right
Temporal representation and reasoning in artificial intelligence: A review
Angelo Montanari

Mathematical and Computer Modelling, 2001

The exphclt representation and ressonmg about time 1s an Important problem m many areas of artHiclal mtelhgence Over the last l&15 years, It has been attractmg the attention of many researchers Several temporal reasonmg systems, dlffermg m design issues related to ontology of time, underlying temporal logic, temporal constramts used and algorithms employed, have been developed In this survey, Important representatIona issues which determme a temporal reasonmg system are introduced

View PDFchevron_right
A Novel Temporal Framework for Relational Event Representation
Sadi Evren SEKER

MSV'12, 2012

"Temporal logics are widely used in many study types, such as question answering, ontology, natural language processing, search engines, text summarization, or even visual tools like Gantt charts or UML diagrams. Computable temporal languages are the logical systems, built on temporal logic, that can be computed to find a result. They can also be defined as computer-computable languages, built on temporal logics. All timeline drawing or planning software uses temporal logic in order to visualize or process cases. Also, semantic web studies are one of implementation areas where the temporal modeling and reasoning is massively needed. Relation between events or event types and event of subjects can be modeled by using temporal logic. This study introduces the temporal logics and the computable temporal languages in the current literature. For the first time, some of temporal logic problems are pointed and solved during this study. Also a novel temporal framework is implemented with JAVA and published on the web which covers the solutions of temporal logic problems."

View PDFchevron_right
Towards a temporal reasoning approach dealing with instance-of, part-of and periodicity
Luca Anselma

10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings., 2003

In many application areas, including planning, workflow, guidelines and protocol management, the description of the domain requires the use of part-of relations between events, the modeling of periodic repetitions and the treatment of "standard" temporal constraints between such events. Events in plans, workflows etc. represent "classes", in the sense that they can be instantiated to specific executions of the plan, guideline etc. Of course, such executions must respect (i.e., be consistent with) the temporal constraints explicitly or implicitly (e.g., by the part-of relation) conveyed by the class descriptions. In this paper, we propose a tractable domain-independent temporal server dealing with the above phenomena. We first sketch a representation formalism coping with partof and instance-of relations, periodicity and temporal constraints, and then we describe two algorithms to deal with inheritance and to perform temporal consistency checking.

View PDFchevron_right
The Representation of a Temporal Data Model in the Relational Environment
Arie Shoshani

Statistical and Scientific Database Management, 1988

In previous work, we introduced a data model and a query language for temporal data. The model was designed independently of any existing data model rather than an extension of one. This approach provided an insight into the special requirements for handling temporal data. In this paper, we discuss the implications of supporting such a model in the relational database

View PDFchevron_right
Representing and Reasoning about Temporal Granularities
Carlo Combi

Journal of Logic and Computation, 2004

In this paper, we propose a new logical approach to represent and to reason about different time granularities.

View PDFchevron_right
Dealing with granularity of time in temporal databases
G. Wiederhold

Lecture Notes in Computer Science, 1991

A question that always arises when dealing with temporal information is the granularity of the values in the domain type. Many different approaches have been proposed; however, the community has not yet come to a basic agreement. Most published temporal representations simplify the issue which leads to difficulties in practical applications. In this paper, we resolve the issue of temporal representation by requiring two domain types (event times and intervals), formalize useful temporal semantics, and extend the relational operations in such a way that temporal extensions fit into a relational representation. Under these considerations, a database system that deals with temporal data can not only present consistent temporal semantics to users but perform consistent computational sequences on temporal data from diverse sources.

View PDFchevron_right
Temporal reasoning about composite and/or periodic events
Paolo Terenziani

Journal of Experimental & Theoretical Artificial Intelligence, 2006

In many application areas, including planning, workflow, guideline and protocol management, the description of the domain involves composite and/or periodic events, mutually related by temporal constraints on the execution order. Such events represent 'classes', since they can be instantiated to specific executions of the plan, guideline etc., and each execution must 'respect' the temporal constraints imposed on the corresponding classes. The main objective of our work is that of proposing an approach dealing with the above-mentioned temporal phenomena. To achieve such an objective, we propose a tractable domain-independent temporal reasoner. This enhances the generality of our approach, which provides a domain-independent module which can be integrated with other software tools to solve temporal problems in specific domains. From the methodological point of view, we first devise a representation formalism coping with the aforesaid phenomena, and then we describe temporal constraint propagation algorithms to deal with constraint inheritance and to perform temporal consistency checking. The representation formalism has been designed carefully, to obtain algorithms that are both complete and tractable. Finally, the paper also shows experimental results, including an application of our approach to clinical guidelines, evaluating their impact on future applications and research activities. * Notice, however, that arbitrary disjunctions of temporal constraints (such as in 'LT1 was during LT2 or LT2 lasted at least 1 hour') cannot be specified by conjunctions of STP constraints, as well as some disjunctive relations in Allen's algebra such as 'LT1 before or after LT2', or relative durations such as 'LT1 lasted twice than LT2'.

View PDFchevron_right
Integration of temporal reasoning and temporal-data maintenance into a reusable database mediator to answer abstract, time-oriented queries: The Tzolkin system
Yuval Shahar

1999

The ability to reason with time-oriented data is central to the practice of medicine. Monitoring clinical variables over time often provides information that drives medical decision making (e.g., clinical diagnosis and therapy planning). Because the time-oriented patient data are often stored in electronic databases, it is important to ensure that clinicians and medical decision-support applications can conveniently find answers to their clinical queries using these databases. To help clinicians and decision-support applications make medical decisions using time-oriented data, a database-management system should (1) permit the expression of abstract, time-oriented queries, (2) permit the retrieval of data that satisfy a given set of time-oriented data-selection criteria, and (3) present the retrieved data at the appropriate level of abstraction. We impose these criteria to facilitate the expression of clinical queries and to reduce the manual data processing that users must undertake to decipher the answers to their queries. We describe a system, Tzolkin, that integrates a general method for temporal-data maintenance with a general method for temporal reasoning to meet these criteria. Tzolkin allows clinicians to use SQL-like temporal queries to retrieve both raw, time-oriented data and dynamically generated summaries of those data. Tzolkin can be used as a standalone system or as a module that serves other software systems. We implement Tzolkin with a temporaldatabase mediator approach. This approach is general, facilitates software reuse, and thus decreases the cost of building new software systems that require this functionality.

View PDFchevron_right

References (131)

  1. A. Ankolekar, M.H. Burstein, J.R. Hobbs, O. Lassila, D.L. Martin, S.A. McIl- raith, S. Narayanan, M. Paolucci, T.R. Payne, K.P. Sycara, and H. Zeng. DAML- S: Web Service Description for the Semantic Web. In Proceedings of the 1 st International Semantic Web Conference, LNCS 2342, pages 411-430. Springer- Verlag, 2002.
  2. L. Al-Khatib. Reasoning with Non-convex Intervals. PhD Thesis, Florida Insti- tute of Technology, 1994.
  3. J.F. Allen. Maintaining Knowledge about Temporal Intervals. Communications of the ACM, 26(11):832-843, 1983.
  4. J. Allen. Planning as Temporal Reasoning. In Proceedings of the 2 nd Inter- national Conference on Principles of Knowledge Representation and Reasoning, pages 3-14. Morgan Kaufmann Publishers, 1991.
  5. T. Anderson. Modeling Events and Processes at the Conceptual Level. In Proceedings of the 2 nd International Conference on Databases, pages 151-168. Wiley Heyden Ltd., 1983.
  6. K.R. Apt. Principles of Constraint Programming. Cambridge University Press, 2003.
  7. L. Bertossi, M. Arenas, and C. Ferretti. SCDBR: An Automated Reasoner for Specifications of Database Updates. Journal of Intelligent Information Systems, 10(3):235-280, 1998.
  8. A. Baker. Non-monotonic Reasoning in the Framework of the Situation Calculus. Artificial Intelligence, 49(1-3):5-23, 1991.
  9. G. Becher, F. Cléin-Debart, and P. Enjalbert. A Qualitative Model for Time Granularity. Computational Intelligence, 16(2):138-169, 2000.
  10. W. Burgard, A.B. Cremers, D. Fox, D. Hähnel, G. Lakemeyer, D. Schulz, W. Steiner, and S. Thrun. The Interactive Museum Tour-guide Robot. In Pro- ceedings of the 15 th National Conference on Artificial Intelligence/10 th Confer- ence on Artificial intelligence/Innovative Applications of Artificial Intelligence, pages 11-18. American Association for Artificial Intelligence, 1998.
  11. K.van Belleghem, M. Denecker, and D. DeSchreye. Combining Situation Calcu- lus and Event Calculus. In Proceedings of the International Conference on Logic Programming, MIT Press, pages 83-97, 1995.
  12. F. Bry, J. Haußer, F.-A. Rieß, and S. Spranger. Cultural Calendars for Pro- gramming and Querying. In Proceedings of the 1 st Forum on the Promotion of European and Japanese Culture and Traditions in Cyber Society and Virtual Reality, 2005.
  13. C. Bettini, S. Jajodia, and S.X. Wang. Time Granularities in Databases, Data Mining, and Temporal Reasoning. Springer-Verlag, 2000.
  14. A. Bochman. Concerted Instance-interval Temporal Semantics: Temporal On- tologies. Notre Dame Journal of Formal Logic, 31(3):403-414, 1990.
  15. F. Bry, F.-A. Rieß, and S. Spranger. CaTTS: Calendar Types and Constraints for Web Applications. In Proceedings of the 14 th International World Wide Web Conference, pages 702-711. ACM Press, 2005.
  16. C. Boutilier, R. Reiter, M. Soutchanski, and S. Thrun. Decision-theoretic, High- level Agent Programming in the Situation Calculus. In Proceedings of the 17 th National Conference on Artificial Intelligence and 12 th Conference on on Inno- vative Applications of Artificial Intelligence,, pages 355-362. AAAI Press / The MIT Press, 2000.
  17. B. Bruce. A Model for Temporal References and its Applications in a Question Answering Program. Artificial Intelligence, 4:1-25, 1972.
  18. F. Bry and S. Spranger. Towards a Multi-calendar Temporal Type System for (Semantic) Web Query Languages. In Proceedings 2 nd International Workshop Principles and Practice in Semantic Web Reasoning, LNCS 3208, pages 69-83. Springer-Verlag, 2004.
  19. I. Cervesato, L. Chittaro, and A. Montanari. A Modal Calculus of Partially Ordered Events in a Logic Programming Framework. In Proceedings of the 12 th International Conference on Logic Programming, pages 299-313. MIT Press, 1995.
  20. E. Ciapessoni, E.Corsetti, A. Montanari, and P. San Pietro. Embedding Time Granularity in a Logical Specification Language for Synchronous Real-time Sys- tems. Science of Computer Programming, 20(1-2):141-171, 1993.
  21. C. Combi, M. Franceschet, and A. Peron. Representing and Reasoning about Temporal Granularities. Journal of Logic and Computation, 14(1):51-77, 2004.
  22. I. Cervesato, A. Montanari, and A. Provetti. On the Non-monotonic Behavior of Event Calculus for Deriving Maximal Time Intervals. Interval Computations, 3(2):83-119, 1993.
  23. J. Clifford and A. Rao. A Simple General Structure for Temporal Domains. In C. Rolland, and M. Leonard (eds.), Temporal Aspects of Information Systems, pages 17-28. Elsevier Science Publishers, 1987.
  24. DARPA Agent Markup Language. A DAML Ontology of Time, 2002.
  25. W. Davis and J. Carnes. Clustering Temporal Intervals to Generate Reference Hierarchies. In Proceedings of the 2 nd International Conference on Principles of Knowledge Representation and Reasoning, pages 111-117. Morgan Kaufman, 1991.
  26. S. Demri. LTL over Integer Periodicity Constraints (Extended Abstract). In Proceedings of 7 th International Conference on Foundations of Software Science and Computation Structures, LNCS 2987, pages 121-135. Springer-Verlag, 2004.
  27. T. Drakengren and P. Jonsson. Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. Journal of Artificial Intelligence Research, 7:25-45, 1997.
  28. M. Denecker, L. Missiaen, and M. Bruynooghe. Temporal Reasoning with Ab- ductive Event Calculus. In Proceedings of the 10 th European Conference on Artificial Intelligence, pages 384-388. John Wiley and Sons, Chichester, 1992.
  29. R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. Artificial Intelligence, 49(1-3):61-95, 1991.
  30. D. Dowty. Word Meaning and Montague Grammar. Kluwer Academic Publish- ers, 1979.
  31. N. Dershowitz and E.M. Reingold. Calendrical Calculations: The Millennium Edition. Cambridge University Press, 2001.
  32. K. Eshghi. Abductive Planning with Event Calculus. In Proceedings of the 5 th International Conference on Logic Programming, MIT Press, pages 562-579, 1988.
  33. J. Euzenat. Représentation Granulaire du Temps. Revue d'Intelligence Artifi- cielle, 7(3):329-361, 1993.
  34. J. Euzenat. A Categorical Approach to Time Representation: First Studies on Qualitative Aspects. In Proceedings of the IJCAI Workshop on Spatial and Temporal Reasoning, pages 142-152, 1995.
  35. J. Euzenat. Granularity in Relational Formalisms with Applications to Time and Space Representation. Computational Intelligence, 17(3):703-737, 2001.
  36. T. Frühwirth and S. Abdennadher. Essentials of Constraint Programming. Cog- nitive Technologies. Springer-Verlag, 2003.
  37. M. Fisher, D. Gabbay, and L. Vila. Handbook of Temporal Reasoning in Artificial Intelligence. J. Hendler, H. Kitano, B. Nebel (eds.), Foundations of Artificial Intelligence: Volume I. Elsevier, 2005.
  38. R. Fikes, P. Hart, and N.J. Nilsson. Learning and Executing Generalized Robot Plans. Artificial Intelligence, 3(4):251-288, 1972.
  39. J.L. Fiadeiro and T. Maibaum. Sometimes "Tomorrow" is "Sometime": Action Refinement in a Temporal Logic of Objects. In Proceedings of the 1 st Interna- tional Conference on Temporal Logic, LNCS 827, pages 48-66. Springer-Verlag, 1994.
  40. M. Franceschet and A. Montanari. A Combined Approach to Temporal Logics for Time Granularity. In Workshop on Methods for Modalities, 2001.
  41. R. Fikes and N. Nilsson. STRIPS: A new Approach to Application of Theorem Proving to Problem Solving. Artificial Intelligence, 2(3-4):189-208, 1971.
  42. C. Freska. Temporal Reasoning Based on Semi-Intervals. Artificial Intelligence, 54(1):199-227, 1992.
  43. A. Fernandes, M. Williams, and N. Paton. A Logic-based Integration of Active and Deductive Databases. New Generation Computing, 15(2):205-244, 1997.
  44. A. Galton. A Critical Examination of Allen's Theory of Action and Time. Artificial Intelligence, 42(2-3):159-188, 1990.
  45. S. Gançarski. Database Versions to Represent Bitemporal Databases. In Pro- ceedings of the 10 th Conference on Database and Expert Systems Applications, LNCS 1677, pages 832-841. Springer-Verlag, 1999.
  46. G. De Giacomo, Y. Lespérance, and H.J. Lévesque. Reasoning about Concur- rent Execution, Prioritized Interrupts, and Exogenous Actions in the Situation Calculus. In Proceedings of the 15 th International Joint Conference on Artificial Intelligence, pages 1221-1226. Morgan Kaufmann Publishers, 1997.
  47. M. Gelfond, V. Lifschitz, and A. Rabinov. What are the Limitations of the Sit- uation Calculus? In Automated Reasoning, Essays in Honor of Woody Bledsoe, (ed.)
  48. S. Boyer, pages 167-181. Kluwer Academic Publishers, 1991.
  49. J. Greer and G. McCalla. A Computational Framework for Granularity and its Application to Educational Diagnosis. In Proceedings of the 11 th International Joint Conference on Artificial Intelligence, pages 477-482. Morgan Kaufmann Publishers, 1989.
  50. M. Grigni, D. Papadias, and C. Papadimitriou. Topological Inference. In Pro- ceedings of the 14 th International Joint Conference on Artificial Intelligence, pages 901-907. Morgan Kaufmann Publishers, 1995.
  51. P.J. Hayes and J.F. Allen. Moments and Points in an Interval-based Temporal Logic. Computational Intelligence, 5(4):225-238, 1989.
  52. C.L. Hamblin. Instants and Intervals. In J.T. Fraser, F.C. Haber, and G.H. Müller (eds.), The Study of Time, pages 324-328. Springer-Verlag, 1972.
  53. D. Harel. First-order Dynamic Logic. LNCS 68. Springer-Verlag, 1979.
  54. D. Harel. Dynamic Logic. In D. Gabby et al. (eds.), Handbook of Philosophical Logic, vol. II, Extensions of Classical Logic, Publishing Company, Dordrecht (NL), 1984.
  55. D. Hernández. Qualitative Representation of Spatial Knowledge. LNAI 804. Springer-Verlag, 1994.
  56. R. Hirsh. Relational Algebras of Intervals. Artificial Intelligence, 83(2):267-295, 1996.
  57. J. Hobbs. Granularity. In Proceedings of the 9 th International Joint Conference on Artificial Intelligence, pages 432-435. Morgan Kaufmann Publishers, 1985.
  58. C. Jensen and C. Dyreson (eds.). The consensus glossary of temporal database concepts -February 1998 version, 1998.
  59. K. Kahn and G.A. Gorry. Mechanizing Temporal Knowledge. Artificial Intelli- gence, 9:87-108, 1977.
  60. A. Krokhin, P. Jeavons, and P. Jonsson. The Tractable Subalgebras of Allen's Interval Algebra. Journal of the ACM, 50(5):591-640, 2003.
  61. H.A. Kautz and P. Ladkin. Integrating Metric and Temporal Qualitative Con- straints. In Proceedings of the 9 th National Conference on Artificial Intelligence, pages 241-246. MIT Press, 1991.
  62. L. Khatib and R. Morris. Generating Scenarios for Periodic Events with Binary Constraints. In Proceedings of the 6 th International Workshop on Temporal Representation and Reasoning, pages 67-72. IEEE Computer Society, 1999.
  63. M. Koubarakis. Dense Time and Temporal Constraints with =. In Proceedings of the 3 rd International Conference on Principles of Knowledge Representation and Reasoning, pages 24-35. Morgan Kaufmann Publishers, 1992.
  64. R. Kowalski. Database Updates in the Event Calculus. Journal of Logic Pro- gramming, 12(1-2):121-146, 1992.
  65. R. Kowalski and M. Sergot. A Logic-based Calculus of Events. New Generation Computing, 4(1):67-95, 1986.
  66. R. Kowalski and F. Sadri. The Situation Calculus and the Event Calculus Compared. In Proceedings of the 1994 International Symposium on Logic Pro- gramming, pages 539-553. MIT Press, 1994.
  67. H. Lévesque. What is Planning in the Presence of Sensing? In Proceedings of the 13 th National Conference on Artificial Intelligence, pages 1139-1146. AAAI Press, 1996.
  68. P.B. Ladkin. The logic of Time Representation. PhD Thesis, University of California, 1987.
  69. V. Lifschitz. Towards a Metatheory of Action. In Proceedings of the 2 nd In- ternational Conference on Principles Knowledge Representation and Reasoning, pages 376-386. Morgan Kaufmann Publishers, 1991.
  70. G. Ligozat. Generalized Intervals: A Guided Tour. In Proceedings of Workshop on Spatial and Temporal Reasoning, 1998.
  71. H. Lévesque, Y. Lespérance, and R. Reiter. A Situation Calculus Approach to Modeling and Programming Agents. In In A. Rao and M.Wooldridge (eds.), Foundations and Theories of Rational Agency, pages 275-299. Kluwer Academic Publishers, 1999.
  72. U. Dal Lago and A. Montanari. Calendars, Time Granularities, and Automata. In Proceedings of the 7 th International Symposium on Advances in Spatial and Temporal Databases, LNCS 2121, pages 279-298. Springer-Verlag, 2001.
  73. B. Leban, D. McDonald, and D. Foster. A Representation for Collections of Temporal Intervals. In Proceedings of the 5 th National Conference on Artificial Intelligence, pages 367-371. Morgan Kaufmann Publishers, 1986.
  74. H. Lévesque, F. Pirri, and R. Reiter. Foundations for the Situation Calculus. Linkping Electronic Articles in Computer and Information Science, 3(18):159- 178, 1998.
  75. F. Lin and Y. Shoham. Provably Correct Theories of Actions. Journal of the ACM, 42(2):293-320, 1995.
  76. J. McCarthy. Actions and other Events in Situation Calculus. In Proceedings of the 8 th International Conference on Principles and Knowledge Representation and Reasoning, pages 615-628. Morgan Kaufmann Publishers, 2002.
  77. D. V. McDermott. A Temporal Logic for Reasoning about Processes and Plans. Cognitive Science, 6:101-155, 1982.
  78. I. Meiri. Combining Qualitative and Quantitative Constraints in Temporal Rea- soning. Artificial Intelligence, 87(1-2):343-385, 1996.
  79. J. Meyer. Dynamic Logic Reasoning about Actions and Agents. In Workshop on Logic-Based Artifical Intelligence, 1999.
  80. J. McCarthy and P. Hayes. Some Philosophical Problems from the Standpoint of Artificial Intelligence. In Readings in Non-monotonic Reasoning, pages 26-45. Morgan Kaufmann Publishers, 1987.
  81. L. Missiaen. Localized Abductive Planning with the Event Calculus. PhD Thesis, Department of Computer Science, K.U. Leuven, 1991.
  82. A. Montanari, E. Maim, E. Ciapessoni, and E. Ratto. Dealing with Time and Granularity in the Event Calculus. In Proceedings of the International Confer- ence on Fifth Generation Computer Systems, pages 702-712. IOS Press, 1992.
  83. A. Montanari. Metric and Layered Temporal Logics for Time Granularity. ILLC Dissertation Series 1996-02, University of Amsterdam, 1996.
  84. R. Moore. A Logic of Knowledge and Action. In Hobbs, J.R. and Moore, R.C. (eds.) Formal Theories of the Common-Sense World, pages 319-358. Ablex, 1985.
  85. A. Montanari and A. Policriti. Decidability Results for Metric and Layered Temporal Logics. Notre Dame Journal of Formal Logic, 37:260-282, 1996.
  86. A. Montanari, A. Peron, and A . Policriti. Theories of Omega-Layered Tem- poral Structures: Expressiveness and Decidability. Logic Journal of the IGPL, 7(1):79-102, 1999.
  87. P. Mateus, A. Pacheco, and J. Pinto. Observations and the Probabilistic Sit- uation Calculus. In Proceedings 8 th International Conference on Principles of Knowledge Representation and Reasoning, pages 327-338. Morgan Kaufmann Publishers, 2002.
  88. R. Miller and M. Shanahan. The Event Calculus in Classical Logic -Alternative Axiomatizations. Linkping Electronic Articles in Computer and Information Science, 4(16), 1999.
  89. S. McIlraith, T. Son, and H. Zeng. Semantic Web Services. IEEE Intelligent Systems, 16(2):46-53, 2001.
  90. I. Newton. The Principia: Mathematical Principles of Natural Philosophy. Uni- versity of California Press, 1936.
  91. W.H. Newton-Smith. The Structure of Time. Routledge & Heagan Paul, 1980.
  92. M. Niezette and J.-M. Stevenne. An Efficient Symbolic Representation of Peri- odic Time. In Proceedings of the 1 st Conference on Information and Knowledge Management, LNCS 752, pages 161-168. Springer-Verlag, 1992.
  93. P. Ning, S.X. Wang, and S. Jajodia. An Algebraic Representation of Calendars. In the Annuals of Mathematics and Artificial Intelligence. Kluwer Academic Publishers, 2002.
  94. H.J. Ohlbach and D. Gabbay. Calendar Logic. Journal of Applied Non-classical Logics, 8(4):291-324, 1998.
  95. G. Özsoyoglu and R. Snodgrass. Temporal and Real-time Databases: A Survey. IEEE Transactions on Knowledge and Data Engineering, 7(4):513-532, 1995.
  96. F. Pan and J.R. Hobbs. Time in OWL-S. In Proceedings of AAAI Spring Symposium on Semantic Web Services, pages 29-36, 2004.
  97. J. Pinto and R. Reiter. Temporal Reasoning in Logic Programming: A Case for the Situation Calculus. In Proceedings of the 10 th International Conference on Logic Programming, pages 203-221. MIT Press, 1993.
  98. V. Pratt. Semantical Considerations on Floyd-Hoare Logic. In Proceedings of the 17 th IEEE Symposium on Foundations of Computer Science, pages 109-121, 1976.
  99. J. Ramos. The Situation and State Calculus: Specification and Verification. PhD Thesis, IST, Universidade Técnica de Lisboa, 2000.
  100. R. Reiter. On Formalizing Database Updates. In Proceedings of the 3 rd Interna- tional Conference on Extending Database Technology, LNCS 580, pages 10-20. Springer-Verlag, 1992.
  101. R. Reiter. Proving Properties of States in the Situation Calculus. Artificial Intelligence, 64(2):337-351, 1993.
  102. R. Reiter. On Specifying Database Updates. Journal of Logic Programming, 25(1):53-91, 1995.
  103. R. Reiter. Knowledge in Action: Logical Foundations for Specifying and Imple- menting Dynamical Systems. MIT Press, 2001.
  104. N. Rescher and J. Garson. Topological Logic. Journal of Symbolic Logic, 33:537- 548, 1968.
  105. J. Rushby, S. Owre, and N. Shankar. Subtypes for Specifications: Predicate Subtyping in PVS. IEEE Transactions on Software Engineering, 24(9):709-720, 1998.
  106. H. Reichgelt and N. Shadbolt. A Specification Tool for Planning Systems. In Proceedings of the 9 th European Conference on Artificial Intelligence,, pages 541-546, 1990.
  107. N. Rescher and A. Urquhart. Temporal Logic. Library of Exact Philosophy. Springer-Verlag, 1971.
  108. Y. Shoham and N. Goyal. Representing Time and Action in AI. Revised Version of: Problems in Formal Temporal Reasoning. Artificial Intelligence, 36(1):49-61, 1988.
  109. C. Sierra, L. Godo, R. López de Màntaras, and M. Manzano. Descriptive Dy- namic Logic and its Application to Reflective Architectures. Future Generation Computer Systems, 12(2-3):157-171, 1996.
  110. M. Shanahan. Prediction is Deduction but Explanation is Abduction. In Proceed- ings of the 11 th International Joint Conference on Artificial Intelligence, pages 1055-1060. Morgan Kaufmann Publishers, 1989.
  111. M. Shanahan. Representing Continuous Change in the Event Calculus. In Proceedings of the 9 th European Conference on Artificial Intelligence, pages 598- 603, 1990.
  112. M. Shanahan. A Circumscriptive Calculus of Events. Artificial Intelligence, 75(2):249-284, 1995.
  113. Y. Shoham. Temporal Logics in AI: Semantical and Ontological Considerations. Artificial Intelligence, 33(1):89-104, 1987.
  114. F. Sadri and R. Kowalski. Variants of the Event Calculus. In Proceedings of the 12 th International Conference on Logic Programming, pages 67-81. MIT Press, 1995.
  115. R. Snodgrass. The TSQL2 Temporal Query Language. Kluwer Academic Pub- lishers, 1995.
  116. S. Spranger. Calendars as Types -Data Modeling, Constraint Reasoning, and Type Checking with Calendars. PhD Thesis. Herbert Utz Verlag, München, 2006.
  117. P. Spruit, R. Wieringa, and J. Meyer. Axiomatization, Declarative Semantics and Operational Semantics of Passive and Active Updates in Logic Databases. Journal of Logic and Computation, 5(1):27-70, 1995.
  118. A. Tuzhilin and J. Clifford. On Periodicity in Temporal Databases. Information Systems, 30(5):619-639, 1995.
  119. P. Terenziani. Integrated Temporal Reasoning with Periodic Events. Computa- tional Intelligence, 16(2):210-256, 2000.
  120. J. van Benthem. The Logic of Time. D. Reidel Publishing Company, 1983; revised and expanded edition, 1991.
  121. P. van Beek and R. Cohen. Exact and Approximate Reasoning about Temporal Relations. Computational Intelligence, 6(3):132-144, 1990.
  122. P. van Hentenryck, V. Saraswat, and Y. Deville. Constraint Processing in cc(FD). Technical Report, unpublished Manuscript, 1992.
  123. M.B. Vilain. A System for Reasoning about Time. In Proceedings of the 2 nd National (US) Conference on Artificial Intelligence, pages 197-201. AAAI Press, 1982.
  124. M.B. Vilain, H.A. Kautz, and P. van Beek. Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report. In Readings in Qualitative Rea- soning about Physical Systems, pages 373-381. Morgan Kaufmann Publishers, 1990.
  125. L. Vila and E. Schwalb. A Theory of Time and Temporal Incidence based on Instants and Periods. In Proceedings of the 3 rd Workshop on Temporal Repre- sentation and Reasoning. IEEE Computer Society, 1996.
  126. S.X. Wang. Algebraic Query Languages on Temporal Databases with Multi- ple Time Granularities. In Proceedings of the 4 th International Conference on Information and Knowledge Management, pages 304-311. ACM Press, 1995.
  127. J. Weber. On the Representation of Concurrent Actions in the Situation Calcu- lus. In Proceedings of the 8 th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pages 28-32. Morgan Kaufmann Publish- ers, 1990.
  128. J. Wijsen. A String-based Model for Infinite Granularities. In Proceedings of the AAAI Workshop on Spatial and Temporal Granularities, pages 9-16, 2000.
  129. G. Wiederhold, S. Jajodia, and W. Litwin. Dealing with Granularity of Time in Temporal Databases. In Proceedings of the 3 rd International Conference on Ad- vanced Information Systems Engineering, LNCS 498, pages 124-140. Springer- Verlag, 1991.
  130. S.X. Wang, S. Jajodia, and V. Subrahmanian. Temporal Modules: An Approach Toward Federated Temporal Databases. Information Sciences -Informatics and Computer Science: An International Journal, 82(1-2):103-128, 1995.
  131. P. Yolum and M. Singh. Flexible Protocol Specification and Execution: Ap- plying Event Calculus Planning Using Commitments. In Proceedings of the 1 st International Joint Conference on Autonomous Agents and Multi Agent Sys- tems, pages 527-534. ACM Press, 2002.

Related papers

Guest editorial: Temporal representation and reasoning
Carlo Combi

Annals of Mathematics and Artificial Intelligence, 2006

View PDFchevron_right
Modeling and Querying Temporal Data
Abdullah Tansel

Encyclopedia of Database Technologies and Applications

Databases in general store current data. However, the capability to maintain temporal data is a crucial requirement for many organizations and provides the base for organizational intelligence. A temporal database has a time dimension and maintains time-varying data (i.e., past, present, and future data). In this article, we focus on the relational data model and address the subtle issues in modeling temporal data, such as comparing database states at two different time points, capturing the periods for concurrent events, and accessing to times beyond these periods, handling multivalued attributes, coalescing, and restructuring temporal data (Gadia 1988, Tansel & Tin, 1997). Many extensions to the relational data model have been proposed for handling temporal data.

View PDFchevron_right
A Logical Temporal Relational Data Model
DR Nadeem Mahmood

Arxiv preprint arXiv:1002.1143, 2010

Abstract: Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little built-in query language support for temporal data management. The model itself ...

View PDFchevron_right
Logical modeling of temporal data
Arie Shoshani

ACM SIGMOD Record, 1987

In this paper we examine the semantics and develop constructs for temporal data independent of any tradltlonal data model, such as the relational or network data models Unhke many other works which extend existing models to support temporal data, our purpose is to characterize the properties of temporal data and operators over them without being influenced by tradltlonal models which were not specifically designed to model temporal data We develop data constructs that represent sequences of temporal values, identify then semantic properties, and define operations over these structures

View PDFchevron_right
Resolution of time concepts in temporal databases
Seung-Kyum Kim

Information Sciences, 1994

In this paper we identify and present three distinct time concepts for precise and lossless information preservation in temporal databases. We provide a formal definition of temporal validity and further extend it to the notion of interpretation-based validity, with which the confusion among various time concepts introduced earlier for temporal databases is resolved. Then, we discuss the problem of preserving multiple past states of a temporal database, which leads to the identification of a maximal set of time concepts. It is shown that the time concept event time is needed to correctly model retroactive and proactive updates, as it is not possible to model them using only the valid and transaction times as thought earlier. We also show the adequacy of three time concepts (event time, along with valid and transaction times) for completely preserving different past states generated by retroactive and proactive updates, error corrections, and delayed updates. In addition, we define the evolution of an object (i.e., object's history) along a single time dimension (valid time) by using temporal and interpretation-based validity. Finally, we sketch the implementation of history for the relational data model. 'Note that the effective time and registration time, similar to the logical time and physical time, respectively, were proposed earlier in [4].

View PDFchevron_right
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved