Integrated temporal reasoning with periodic events

Computational Intelligence

Volumn 16, Issue 2, 2000, Pages 210-256

  Terenziani, Paolo ^a,b  

^a UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; INTEGRATION;

TEMPORAL REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 0033905353     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00112     Document Type: Article

References (73)

1. ABADI, M., and Z. MANNA. 1989. Temporal logic programming. Journal of Symbolic Computation, 8(3):277-295.
2. ALLEN, J. F. 1983. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-843.
3. ALLEN, J. F. 1984. Towards a general theory of action and time. Artificial Intelligence, 23(2):123-154.
4. ALLEN, J. 1991a. Time and time again: The many ways to represent time. International Journal of Intelligent Systems, 6(4):341-355.
5. ALLEN, J. 1991b. Planning as temporal reasoning. In Proceedings of Knowledge Representation, pp. 3-14.
6. ALLEN, J., and P. HAYES. 1985. A commonsense theory of time. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI'95), Los Angeles, pp. 528-531.
7. ALLEN, J. F., AND E. YAMPRATOOM. 1993. Performance of temporal reasoning systems. Sigart Bulletin, 4(3):26-29.
8. APT, K. R., H. A. BLAIR, and A. WALKER. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, Edited by J. Minker. Morgan Kaufmann, Los Altos, CA, pp. 89-148.
9. BAUDINET, M. 1989. Temporal logic programming is complete and expressive. In Proceedings of the ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, Austin, Texas, pp. 267-279.
10. BAUDINET, M., J. CHOMICKI, and P. WOLPER. 1993. Temporal databases: Beyond finite extensions. In Proceedings of the International Workshop on an Infrastructure for Temporal Databases, Arlington, Texas.
11. BERTINO, E., C. BETTINI, E. FERRARI, and P. SAMARATI. 1998. An access control model supporting periodicity constraints and temporal reasoning. ACM Transactions on Database Systems, 23(3):231-285.
12. BETTINI, C., and R. DE SIBI. 1999. Symbolic representation of user-defined time granularities. In Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'99). IEEE Computer Society, Orlando, FL, pp. 17-28.
13. BETTINI, C., C. DYRESON, W. EVANS, R. SNODGRASS, and X. WANG. 1998. A glossary of time granularity concepts. In Temporal Databases: Research and Practice. Springer Verlag, LNCS 1399, pp. 406-413.
14. BOUZID, M., and P. LADKIN. 1995. Rules for simple temporal reasoning. In Proceedings of the Second International Workshop on Temporal Representation and Reasoning (TIME'95), Melbourne, FL, pp. 81-88.
15. BRACHMAN, R., V. PIGMAN GILBERT, and H. LEVESQUE. 1985. An essential hybrid reasoning system: Knowledge and symbol level accounts in KRYPTON. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI'95), Los Angeles, pp. 532-539.
16. BRACHMAN, R., and J. SCHMOLZE. 1985. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171-216.
17. BRUSONI, V., L. CONSOLE, B. PERNICI, and P. TERENZIANI. 1997. LaTeR: An efficient, general-purpose manager of temporal information. IEEE Expert, 12(4):56-64.
18. BRUSONI, V., L. CONSOLE, and P. TERENZIANI. 1995. On the computational complexity of querying bounds on differences constraints. Artificial Intelligence, 74(2):367-379.
19. CHANDRA, R., and A. SEGEV. 1993. Managing temporal financial data in an extensible database. In Proceedings of the Nineteenth International Conference on Very Large Databases, Dublin, Ireland, pp. 81-87.
20. CHANDRA, R., A. SEGEV, and M. STONEBRAKER. 1994. Implementing calendars and temporal rules in next generation databases. In Proceedings of the International Conference on Data Engineering, Houston, Texas, pp. 264-273 (see also LBL Technical Report 34229, University of California, Berkeley, 1993).
21. CHOMICKI, J., and T. IMIELINSKY. 1988. Temporal deductive databases and infinite objects. In Proceedings of the Seventh ACM Symposium Principles of Database Systems, Austin, Texas, pp. 61-73.
22. CHOMICKI, J., and T. IMIELINSKY. 1993. Finite representation of infinite query answers. ACM Transactions on Database Systems, 18(2): 181-223.
23. CONSOLE, L., and P. TERENZIANI. 1999a. Efficient processing of queries and assertions about qualitative and quantitative temporal constraints. Computational Intelligence, 15(4):442-465.
24. CONSOLE, L., and P. TERENZIANI. 1999b. Efficient query answering in expressive temporal constraint query and data languages. Dipartimento di Informatica, Universita' di Torino, Technical Report 46-99.
25. CUKIERMAN, D., and J. DELGRANDE. 1995. A language to express time intervals and repetition. In Proceedings of the Second International Workshop on Temporal Representation and Reasoning (TIME'95), Melbourne, FL, pp. 41-48.
26. CUKIERMAN, D., and J. DELGRANDE. 1996. Characterizing temporal repetition. In Proceedings of the third International Workshop on Temporal Representation and Reasoning (TIME'96). IEEE Computer Society Press, New York, pp. 80-87.
27. CUKIERMAN, D., and J. DELGRANDE. 1998. Expressing time intervals and repetition within a formalization of calendars. Computational Intelligence, 14(4):563-597.
28. DAVIS, E. 1987. Constraint propagation with interval labels. Artificial Intelligence, 32:281-331.
29. DECHTER, R., I. MEIRI, and J. PEARL. 1991. Temporal constraint networks. Artificial Intelligence, 49:61-95.
30. GUARNERO, A., M. MARZUOLI, G. MOLINO, P. TERENZIANI, M. TORCHIO, and K. VANNI. 1998. Contextual and temporal clinical guidelines. Journal of the American Medical Informatics Association, In Proceedings AMIA'98 Annual Symposium, Orlando, FL, pp. 683-687.
31. KABANZA, F., J.-M. STEVENNE, and P. WOLPER. 1990. Handling infinite temporal data. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium Principles of Database Systems, Nashville, Tennessee, pp. 392-403.
32. KOOMEN, J. 1991. Reasoning about recurrence. International Journal of Intelligent Systems, 6(5):461-496.
33. th International Conference on Database and Expert Systems Applications (DEXA), pp. 124-133.
34. LADKIN, P. 1986a. Primitive and units for time specification. Proceedings of the Fifth National Conference on Artificial Intelligence, Philadelphia, pp. 354-359.
35. LADKIN, P. 1986b. Time representation: A taxonomy of interval relations. Proceedings of the Fifth National Conference on Artificial Intelligence, Philadelphia, pp. 360-366.
36. LADKIN, P. B., and R. D. MADDUX. 1994. On binary constraints problems. Journal of the ACM, 41(3):435-469.
37. LEBAN, B., D. D. MCDONALD, and D. R. FORSTER. 1986. A representation for collections of temporal intervals. In Proceedings of the Fifth National Conference on Artificial Intelligence, Philadelphia, pp. 367-371.
38. LIGOZAT, G. 1991. On generalized interval calculi. In Proceedings of the Ninth National Conference on Artificial Intelligence, pp. 234-240.
39. LOGANANTHARAJ, R., and S. GIMBRONE. 1995a. Probabilistic approach for representing and reasoning with repetitive events. In Proceedings of the Second International Workshop on Temporal Representation and Reasoning (TIME'95), Melbourne, FL, pp. 26-30.
40. LOGANANTHARAJ, R., and S. GIMBRONE. 1995b. Representation of, and reasoning with, near-periodic recurrent events. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence Workshop on Spatial and Temporal Reasoning.
41. LOGANANTHARAJ, R., and S. GIMBRONE. 1997. Issues on synchronizing when propagating temporal constraints. In Proceedings of the National Conference on Artificial Intelligence Workshop on Spatial and Temporal Reasoning, pp. 113-119.
42. LOGANANTHARAJ, R., and S. KURKOVSKY. 1997. A new model for projecting temporal distance using fuzzy temporal constraints. In Proceedings of the IEA/AIE'97.
43. LORENTZOS, N., and R. JOHNSON. 1988. Extending relational algebra to manipulate temporal data. Information Systems, 13(3):289-296.
44. MANNA, Z., and A. PNUELI. 1992. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag.
45. MEIRI, I. 1991. Combining qualitative and quantitative constraints in temporal reasoning. In Proceedings of the National Conference on Artificial Intelligence, pp. 260-267.
46. MORRIS, R. A., L. KHATIB, and G. LIGOZAT. 1995. Generating scenarios from specifications of repeating events. In Proceedings of the Second International Workshop on Temporal Representation and Reasoning (TIME'95), Melbourne, FL, pp. 41-48.
47. MORRIS, R. A., W. D. SHOAFF, and L. KHATIB. 1993. Path consistency in a network of non-convex intervals. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence (IJCAI'93), Chambery, France, pp. 655-660.
48. MORRIS, R. A., W.D. SHOAFF, and L. KHATIB. 1996. Domain independent temporal reasoning with recurring events. Computational Intelligence, 12(3):450-477.
49. NEBEL, B. 1990. Reasoning and Revision in Hybrid Representation Systems, Lecture Notes in Artificial Intelligence 422. Springer-Verlag.
50. NEBEL, B. and K. VON LUCK. 1988. Hybrid reasoning in BACK. In Methodologies for Intelligent Systems 3. Edited by Z. W. Ras and L. Saitta. North Holland, Amsterdam, pp. 260-269.
51. NIEZETTE, M., and J.-M. STEVENNE. 1992. An efficient symbolic representation of periodic time. In Proceedings of the First International Conference Information and Knowledge Management, Baltimore, Maryland, pp. 161-168.
52. POESIO, M. 1988. Toward a hybrid representation of time. In Proceedings of the European Conference on Artificial Intelligence (ECAI'8), Munich, pp. 247-252.
53. POESIO, M., and R. J. BRACHMAN. 1991. Metric constraints for maintaining appointments: Dates and repeated activities, in Proceedings of the Ninth National Conference on Artificial Intelligence, pp. 253-259.
54. QUANTZ, J. and C. KINDERMANN. 1990. Implementation of the BACK system version 4. KIT-Report 78, Technische Universitat Berlin, December 1990.
55. SCHMOLZE, J., and W. MARK. 1991. The NIKL experience. Computational Intelligence, 6:48-69.
56. SNODGRASS, R. 1995. The TSQL2 query language. Kluver Academic.
57. SOO, M., and R. SNODGRASS. 1993. Multiple calendar support for conventional database management systems. In Proceedings of the International Workshop on an Infrastructure for Temporal Databases, Arlington, Texas.
58. STONEBRAKER, M. R. 1990. Extendibility. In Readings in Database Systems, Chap. 7. Edited by M. R. Stonebraker. Morgan Kaufmann.
59. TERENZIANI, P. 1995. Reasoning about periodic events. In Proceedings of the Second International Workshop on Temporal Representation and Reasoning (TIME'95), Melbourne, FL, pp. 137-144.
60. TERENZIANI, P. 1996. Towards an ontology dealing with periodic events. In Proceedings of the European Conference on Artificial Intelligence (ECAI'96), Budapest, pp. 43-47.
61. TERENZIANI, P. 1997a. Integrating calendar-dates and qualitative temporal constraints in the treatment of periodic events. IEEE Transactions on Knowledge and Data Engineering, 9(5):763-783.
62. TERENZIANI, P. 1997b. Qualitative and quantitative temporal constraints about numerically quantified periodic events. In Proceedings of the Fourth International Workshop on Temporal Representation and Reasoning (TIME'97). IEEE Computer Society Press, Daytona Beach, FL, pp. 94-101.
63. TERENZIANI, P. 1998. Generating instantiations of contextual scenarios of periodic events. In Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning (TIME'98), IEEE Computer Society Press, Sanibel Island, FL.
64. TERENZIANI, P., and P. TORASSO. 1995. Time, action-types and causation: An integrated analysis. Computational Intelligence 11(3):529-552.
65. TOMAN, D., J. CHOMIKI, and D. S. ROGERS. 1994. Datalog with integer periodicity constraints. In Proceedings of the ILPS'94. MIT Press, Cambridge, MA, pp. 189-203.
66. TUZHILIN, A., and J. CLIFFORD. 1995. On periodicity in temporal databases. Information Systems, 20(8):619-639.
67. VAN EYNDE, F. 1987. Iteration, habituality and verb form semantics. In Proceedings of the Third Conference of European Chapter of the Association for Computational Linguistics, Copenhagen, pp. 270-277.
68. VARDI, M. Y. 1988. A temporal fixpoint calculus. In Proceedings of the Fifteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 250-259.
69. VILA, L. 1994. A survey on temporal reasoning in artilicial intelligence. AI Communications, 7(1):4-28.
70. VILAIN, M., and H. KAUTZ. 1986. Constraint propagation algorithms for temporal reasoning. In Proceedings of the Fifth National Conference on Artificial Intelligence, Philadelphia, pp. 377-382.
71. VILAIN, M., H. KAUTZ, and P. VAN BEEK. 1990. Constraint propagation algorithms for temporal reasoning: A revised report. In Readings in Qualitative Reasoning about Physical Systems. Edited by D. S. Weld, J. deKleer. Morgan Kaufmann, pp. 373-381.
72. WETPRASIT, R., A. SATTAR, and L. KHATIB. 1996. Reasoning with sequences of point events. In Proceedings of the Third International Workshop on Temporal Representation and Reasoning (TIME'96). IEEE Computer Society Press, pp. 36-38.
73. WOLPER, P. 1983. Temporal logic can be more expressive. Information and Control, 56:72-99.