This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Integrating Calendar Dates and Qualitative Temporal Constraints in the Treatment of Periodic Events
September-October 1997 (vol. 9 no. 5)
pp. 763-783

Abstract—The paper describes a framework for representing and reasoning with periodic events. In particular, it proposes a temporal formalism which deals with both 1) quantitative information concerning the frame of time (e.g., between 1990 and 1993) and the user-defined calendar-dates (e.g., on the first Mondays of April) in which periodic events are located and 2) the qualitative relations between periodic events (e.g., Sam visits the branch office X01 before going to his office). The meaning of the temporal specifications in our formalism is described in logical terms. The paper defines the basic operations of inversion, intersection and composition of temporal specifications. These operations are correct (with respect to the logical definition of the specifications) and do not lose information. Finally, the paper also describes a correct algorithm which takes advantage of these operations for performing temporal reasoning, and analyses its complexity. An application of the temporal framework to the scheduling in an office is shown in an example.

[1] M. Abadi and Z. Manna, “Temporal Logic Programming,” J. Symbolic Computation, vol. 8, no. 3, pp. 277-295, Sept. 1989.
[2] J.F. Allen, “Maintaining Knowledge about Temporal Intervals,” Comm. ACM, vol. 26, no. 11, pp. 832–843, 1983.
[3] J. Allen, "Towards A General Theory of Action and Time," Artificial Intelligence, Vol. 23, No. 2, July 1984, pp. 123-154.
[4] J. Allen, "Time and Time Again: The Many Ways to Represent Time," Int'l J. Intelligent Systems, vol. 6, no. 4, pp. 341-355, July 1991.
[5] J.F. Allen, "Planning As Temporal Reasoning," Proc. Second Int'l Conf. Knowledge Representation and Reasoning, pp. 3-14,Cambridge, Mass., Apr. 1991.
[6] J.F. Allen and P. Hayes, "A Commonsense Theory of Time," Proc. Ninth Int'l Joint Conf. Artificial Intelligence, pp. 528-531,Los Angeles, Aug. 1985.
[7] K. Apt, H.A. Blair, and A. Walker, "Towards a Theory of Declarative Knowledge," Foundations of Deductive Databases and Logic Programming, J. Minker, ed., pp. 89-148. Morgan Kaufmann, 1988.
[8] M. Baudinet, "Temporal Logic Programming is Complete and Expressive," Proc. ACM SIGACT-SIGPLAN Symp. Principles of Programming Languages, pp. 267-279,Austin, Texas., Jan. 1989.
[9] M. Baudinet,M. Niézette, and P. Wolper,"On the representation of infinite temporal data and queries (extended abstract)," Proc. ACM Symp. Principles of Database Systems, pp. 280-290,Denver, May 1991.
[10] M. Baudinet, J. Chomicki, and P. Wolper, "Temporal Databases: Beyond Finite Extensions," Proc. Int'l Workshop on an Infrastructure for Temporal Databases,Arlington, Texas, June 1993.
[11] M. Bouzid and P. Ladkin, "Rules for Simple Temporal Reasoning," Proc. TIME-95 Int'l Workshop on Temporal Representation and Reasoning, pp. 81-88,Melbourne, Fla., Apr. 1995.
[12] R. Brachman and J. Schmolze, "An Overview of the KL-ONE Knowledge Representation System," Cognitive Science, vol. 9, no. 2, pp. 171-216, Apr.-June 1985.
[13] V. Brusoni, L. Console, B. Pernici, and P. Terenziani, “Extending Temporal Relational Databases to Deal with Imprecise and Qualitative Temporal Information,” J. Clifford and A. Tuzhilin, eds., Recent Advances of Temporal Databases, pp. 3-22, 1995.
[14] R. Chandra and A. Segev, "Managing Temporal Financial Data in an Extensible Database," Proc. 19th Int'l Conf. Very Large Databases, 1993.
[15] R. Chandra, A. Segev, and M. Stonebraker, “Implementing Calendars and Temporal Rules in Next Generation Databases,” Proc. Int'l Conf. Data Eng., pp. 264-273, 1994.
[16] J. Chomicki and T. Imielinsky, “Temporal Deductive Databases and Infinite Objects,” Proc. Seventh ACM Symp. Principles of Database Systems, pp. 61-73, Mar. 1988.
[17] J. Chomicki and T. Imielinsky, “Finite Representation of Infinite Query Answers,” ACM Trans. Database Systems, vol. 18, no. 2, pp. 181-223, June 1993.
[18] J. Clifford and A. Rao, "A Simple, General Structure for Temporal Domains," C. Rolland, F. Bodart, and M. Leonard, eds., Temporal Aspects in Information System, pp. 17-28, NorthHolland, 1988.
[19] D. Cukierman and J. Delgrande, "A Language to Express Time Intervals and Repetition," Proc. TIME-95 Int'l Workhop on Temporal Representation and Reasoning, pp. 41-48,Melbourne, Fla., Apr. 1995.
[20] S.K. Gadia and C.-S. Yeung, “A Generalized Model for a Relational Temporal Database,” Proc. ACM SIGMOD Int'l Conf. Management of Data, 1988.
[21] T. Imielinski, “Data on Air—What's in It for the Database Theorist,” Proc. Conf. Database Theory, pp. 1-13, 1995.
[22] F. Kabanza, J.-M. Stevenne, and P. Wolper, “Handling Infinite Temporal Data,” Proc. ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 392-403, Apr. 1990.
[23] Special Issue on Medical Temporal Reasoning, E. Keravnou, ed., Artificial Intelligence in Medicine, vol. 3, no. 6, Dec. 1991.
[24] J. Koomen, "Reasoning about Recurrence," Int'l J. Intelligent Systems, vol. 6, no. 5, pp. 461-496, Aug. 1991.
[25] M. Koubarakis,“Database models for infinite and indefinite temporal information,” Information Systems, vol. 19, no. 2, pp. 141-173, 1994.
[26] P. Ladkin, "Primitive and Units for Time Specification," Proc. Fifth National Conf. Artificial Intelligence, pp. 354-359,Philadelphia, Aug. 1986.
[27] P. Ladkin, "Time Representation: A Taxonomy of Interval Relations," Proc. Fifth Nat'l Conf. Artificial Intelligence, pp. 360-366,Philadelphia, Aug. 1986.
[28] B. Leban, D.D. McDonald, and D.R. Forster, "A Representation for Collections of Temporal Intervals," Proc.Fifth Nat'l Conf. Artificial Intelligence, pp. 367-371,Philadelphia, Penn., Aug. 1986.
[29] G. Ligozat, "On Generalized Interval Calculi," Proc. Ninth Nat'l Conf. Artificial Intelligence, pp. 234-240, July 1991.
[30] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: Springer-Verlag, 1987.
[31] R. Loganantharaj and S. Gimbrone, "Probabilistic Approach for Representing and Reasoning with Repetitive Events," Proc. Eighth Florida Artificial Intelligence Symp., pp. 26-30,Melbourne, Fla., Apr. 1995.
[32] N.A. Lorentzos and R.G. Johnson, "Extending Relational Algebra to Manipulate Temporal Data," Information Systems, vol. 13, no. 3, pp. 289-296, 1988.
[33] R.A. Morris, W.D. Shoaff, and L. Khatib, "Path Consistency in a Network of Nonconvex Intervals," Proc. 13th Int'l Joint Conf. Artificial Intelligence, pp. 655-660,Chambery, France, Aug. 1993.
[34] R.A. Morris, L. Khatib, and G. Ligozat, "Generating Scenarios from Specifications of Repeating Events," Proc. TIME-95 Int'l Workhop on Temporal Representation and Reasoning, pp. 41-48,Melbourne, Fla., Apr. 1995.
[35] B. Nebel, Reasoning and Revision in Hybrid Representation Systems, Vol. 422, Lecture Notes in Artificial Intelligence. Berlin, Heidelberg, New York: Springer-Verlag, 1990.
[36] M. Niezette and J.-M. Stevenne, "An Efficient Symbolic Representation of Periodic Time," Proc. First Int'l Conf. Information and Knowledge Management,Baltimore, Md., Nov. 1992.
[37] M. Poesio, "Toward a Hybrid Representation of Time," Proc. Eighth European Conf. Artificial Intelligence, pp. 247-252,Munich, Aug. 1988.
[38] J. Quantz and C. Kindermann, "Implementation of the BACK System Version 4," KIT-REPORT-78, Technische Universitaet Berlin, 1990.
[39] Proc. Int'l Workshop on an Infrastructure for Temporal Databases, R. Snodgrass, ed., Arlington, Texas, June 1993.
[40] The TSQL2 Temporal Query Language. R.T. Snodgrass, ed., Kluwer Academic Publishers, 1995.
[41] M. Soo and R. Snodgrass, "Multiple Calendar Support for Conventional Database Management Systems," Proc. Int'l Workshop Infrastructure for Temporal Databases,Arlington, Texas, June 1993.
[42] M.R. Stonebraker, "Extendibility," M.R. Stonebraker, ed., Readings in Database Systems, ch. 7. Morgan Kaufmann, 1990.
[43] Temporal Databases: Theory, Design and Implementation. A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev and R. Snodgrass, eds. Benjamin/Cummings, 1993.
[44] P. Terenziani, "Integrating Calendar-Dates and Qualitative Temporal Constraints in the Treatment of Periodic Events," Technical Report 12/95, Dipartimento di Informatica, Universita' di Torino, 1995.
[45] P. Terenziani and P. Torasso, "Towards an Integration of Time and Causation in a Hybrid Knowledge Representation Formalism," Int'l J. Intelligent Systems, vol. 9, no. 3, pp. 303-338, Mar. 1994.
[46] P. Terenziani and P. Torasso, "Time, Action-types and Causation: an Integrated Analysis," Computational Intelligence, vol. 11, no. 3, pp. 529-552, Aug. 1995.
[47] P. VanBeek and R. Cohen, "Exact and Approximate Reasoning about Temporal Relations," Computational Intelligence, vol. 6, no. 3, pp. 132-144, Aug. 1990.
[48] F. Van Eynde, “Iteration, Habituality and Verb Form Semantics,” Proc. Third Conf. European Chapter of the Assoc. for Computational Linguistics, pp. 270-277, Apr. 1987.
[49] M. Vilain and H. Kautz, "Constraint Propagation Algorithms for Temporal Reasoning," Proc. Fifth Nat'l Conf. Artificial Intelligence, pp. 376-382,Philadelphia, Aug. 1986.
[50] M. Vilain, H. Kautz, and P. VanBeek, “Constraint Propagation Algorithms for Temporal Reasoning: A Revised Report,” D.S. Weld and J. de Kleer, eds., Readings in Qualitative Reasoning About Physical Systems, pp. 373–381, Morgan Kaufmann, 1989.

Index Terms:
Knowledge representation and reasoning; temporal information about periodic events; representation and treatment of user-defined calendar dates; representation and treatment of qualitative temporal relations between periodic events; integration of user-defined calendar dates and qualitative information; inversion, intersection and composition of temporal specifications about periodic events; temporal reasoning for amalgamating a knowledge base of temporal information about periodic events and checking its consistency.
Citation:
Paolo Terenziani, "Integrating Calendar Dates and Qualitative Temporal Constraints in the Treatment of Periodic Events," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 5, pp. 763-783, Sept.-Oct. 1997, doi:10.1109/69.634754
Usage of this product signifies your acceptance of the Terms of Use.