Temporalized logics and automata for time granularity

Theory and Practice of Logic Programming

Volumn 4, Issue 5-6, 2004, Pages 621-658

  Franceschet, Massimo ^a   Montanari, Angelo ^b  

^a UNIVERSITY OF CHIETI   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Automata theory; Temporal logic; Time granularity

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; COMPUTER SCIENCE; DATA MINING; DATABASE SYSTEMS; NATURAL LANGUAGE PROCESSING SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES;

REAL-TIME LOGICS; SYSTEM SPECIFICATIONS; TEMPORAL LOGICS; TIME GRANULARITY;

FORMAL LOGIC;

EID: 4444384403     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S147106840400208X     Document Type: Conference Paper

References (65)

1. AGRAWAL, R. AND SRIKANT, R. 1995. Mining sequential patterns. In Proceedings International Conference on Data Engineering. IEEE Press, pp. 3-14.
2. BETTINI, C., BRODSKY, A., JAJODIA, S. AND WANG, X. S. 1997. Logical design for temporal databases with multiple granularities. ACM Transactions on Database Systems 22, 2, 115-170.
3. BETTINI, C., JAJODIA, S., LIN, J. AND WANG, X. S. 1998. Discovering frequent event patterns with multiple granularities in time sequences. IEEE Transactions on Knowledge and Data Engineering 10, 2, 222-237.
4. BETTINI, C., JAJODIA, S. AND WANG, X. 1996a. A general framework and reasoning models for time granularity. In Proceedings of the International Workshop on Temporal Representation and Reasoning. IEEE Press, pp. 104-111.
5. BETTINI, C., JAJODIA, S. AND WANG, X. S. 1996b. Testing complex temporal relationships involving multiple granularities and its application to data mining. In Proceedings ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Vol. 15. ACM Press, pp. 68-78.
6. BLACKBURN, P. AND BOS, J. 2003. Representation and Inference for Natural Language. Studies in Logic, Language, and Information. CSLI Press.
7. CHANDRA, R., SEGEV, A. AND STONEBRAKER, M. 1994. Implementing calendars and temporal rules in next generation databases. In Proceedings International Conference on Data Engineering. IEEE Press, Houston, TX, pp. 264-273.
8. CHAOCHEN, Z AND HANSEN, M. R. 1998. An adequate first order interval logic. In Compositionality: the Significant Difference, W. de Roever, H. Langmaak and A. Pnueli, Eds. Lecture Notes in Computer Science, vol. 1536, pp. 584-608.
9. CIAPESSONI, E., CORSETTI, E., MONTANARI, A. AND SAN PIETRO, P. 1993. Embedding time granularity in a logical specification language for synchronous real-time systems. Science of Computer Programming 20, 141-171.
10. COMBI, C., FRANCESCHET, M. AND PERON, A. 2002. A logical approach to represent and reason about calendars. In Proceedings International Symposium on Temporal Representation and Reasoning. IEEE Press, pp. 134-140.
11. COMBI, C. AND POZZI, G. 2001. A temporal data model managing intervals with different granularities and indeterminacy from natural language sentences. The VLDB Journal 9, 294-311.
12. CORSETTI, E., CRIVELLI, E., MANDRIOLI, D., MONTANARI, A., MORZENTI, A., PIETRO, P. S. AND RATTO, E. 1991. Dealing with different time scales in formal specifications. In Proceedings International Workshop on Software Specification and Design. IEEE Press, pp. 92-101.
13. CORSETTI, E., MONTANARI, A. AND RATTO, E. 1991. Dealing with different time granularities in formal specifications of real-time systems. Journal of Real-Time Systems 3, 191-215.
14. COURCOUBETIS, C., VARDI, M., WOLPER, P. AND YANNAKAKIS, M. 1991. Memory efficient algorithms for the verification of temporal properties. In Proceedings Computer-Aided Verification. Lecture Notes in Computer Science, vol. 531. Springer, Berlin, Germany, pp. 233-242.
15. CUKIERMAN, D. AND DELGRANDE, J. 1998. Expressing time intervals and repetition within a formalization of calendars. Computational Intelligence 14, 4, 563-597.
16. DAM, M. 1994. CTL* and ECTL* as fragments of the modal μ-calculus. Theoretical Computer Science 126, 77-96.
17. DREYER, W., DITTRICH, A. K. AND SCHMIDT, D. 1994. Research perspectives for time series management systems. SIGMOD Record 23, 1, 10-15.
18. DYRESON, C. E. AND SNODGRASS, R. T. 1995. Temporal granularity. In The TSQL2 Temporal Query Language, R. T. Snodgrass, Ed. Kluwer Academic Press, pp. 347-385.
19. EMERSON, E. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, Ed. Elsevier, pp. 995-1072.
20. EUZENAT, J. 1995. An algebraic approach for granularity in qualitative space and time representation. In Proceedings of the International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 894-900.
21. FIADEIRO, J. L. AND MAIBAUM, T. 1994. Sometimes "tomorrow" is "sometime": Action refinement in a temporal logic of objects. In Proceedings of the International Conference on Temporal Logic. Lectures Notes on Artificial Intelligence, vol. 827. Springer, pp. 48-66.
22. FINGER, M. AND GABBAY, D. M. 1992. Adding a temporal dimension to a logic system. Journal of Logic Language and Information 1, 203-233.
23. FOSTER, D., LEBAN, B. AND MCDONALD, D. 1986. A representation for collections of temporal intervals. In Proceedings National Conference on Artificial Intelligence, pp. 367-371.
24. FRANCESCHET, M. 2002. Dividing and conquering the layered land. PhD thesis, Department of Mathematics and Computer Science, University of Udine.
25. FRANCESCHET, M. AND MONTANARI, A. 2001 a. A combined approach to temporal logics for time granularity. In Proceedings of the International Workshop on Methods for Modalities (M4M).
26. FRANCESCHET, M. AND MONTANARI, A. 2001b. Towards an automata-theoretic counterpart of combined temporal logics. In Proceedings International Workshop on Verification and Computational Logic, pp. 55-74.
27. FRANCESCHET, M. AND MONTANARI, A. 2002. Time granularities in databases, data mining, and temporal reasoning, by Bettini, Jajodia, and Wang (book review). Computer Journal 45, 6, 683-685.
28. FRANCESCHET, M. AND MONTANARI, A. 2003. Branching within time: an expressively complete and elementarily decidable temporal logic for time granularity. Research on Language and Computation 1, 3-4, 229-263.
29. FRANCESCHET, M., MONTANARI, A. AND DE RIJKE, M. 2000. Model checking for combined logics. In Proceedings of the International Conference on Temporal Logic, pp. 65-73.
30. FUM, D., GUIDA, G., MONTANARI, A. AND TASSO, C. 1989. Using levels and viewpoints in text representation. In Proceedings International Conference on Artificial Intelligence and Information-Control Systems of Robots, pp. 37-44.
31. GABBAY, D., KURUCZ, A., WOLTER, F. AND ZAKHARYASCHEV, M. 2003. Many-dimensional modal logics: theory and applications. Studies in Logic and the Foundations of Mathematics, vol. 148. Elsevier.
32. GABBAY, D. M. AND DE RIJKE, M., Eds. 2000. Frontiers of Combining Systems 2. Studies in Logic and Computation, vol. 7. Research Studies Press/Wiley.
33. HAFER, T. AND THOMAS, W. 1987. Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. In Proceedings International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 267. Springer, Karlsruhe, Germany, pp. 269-279.
34. HALPERN, J. Y. AND SHOHAM, Y. 1991. A prepositional modal logic of time intervals. Journal of the ACM 38, 4, 935-962.
35. IMMERMAN, N. AND KOZEN, D. 1989. Definability with bounded number of bound variables. Information and Computation 83, 2, 121-139.
36. JAJODIA, S., LITWIN, W. AND WIEDERHOLD, G. 1993. Integrating temporal data in a heterogeneous environment. In Temporal Databases: Theory, Design and Implementation, A. Tansel et al., Ed. Database Systems and Applications Series, Benjamin/Cummings, Redwood City, CA, pp. 563-579.
37. JAJODIA, S., SUBRAHMANIAN, V. S. AND WANG, X. S. 1995. Temporal modules: An approach toward federated temporal databases. Information Sciences 82, 103-128.
38. JARD, C. AND JERON, T. 1989. On-line model checking for finite linear temporal logic specifications. In Proceedings Workshop on Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science, vol. 407. Springer, pp. 189-196.
39. KAMP, H. AND SCHIEHLEN, M. 2001. Temporal location in natural language. In How to say when it happens, H. Kamp and U. Reyle, Eds. Max Niemeyer Verlag.
40. KUPFERMAN, O., VARDI, M. Y. AND WOLPER, P. 2000. An automata-theoretic approach to branching-time model checking. Journal of the ACM 47, 2, 312-360.
41. LADKIN, P. 1987. The completeness of a natural system for reasoning with time intervals. In Proceedings International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 462-467.
42. LAMPORT, L. 1985. On interprocess communication. Tech. Rep. 8, SRC, Palo Alto, CA.
43. MANNILA, H., TOIVONEN, H. AND VERKAMO, A. I. 1995. Discovering Frequent Episodes in Sequences. In Proceedings International Conference on Knowledge Discovery and Data Mining. AAAI Press, Montreal, Canada.
44. MONTANARI, A. 1996. Metric and Layered Temporal Logic for Time Granularity. ILLC Dissertation Series 1996-02, ILLC, University of Amsterdam, The Netherlands.
45. MONTANARI, A., MAIM, E., CIAPESSONI, E. AND RATTO, E. 1992. Dealing with time granularity in the event calculus. In Proceedings International Conference on fifth Generation Computer Systems, pp. 702-712.
46. MONTANARI, A. AND PERNICI, B. 1993. Temporal reasoning. In Temporal Databases, A. Tansel et al., Eds. Database Systems and Applications Series. Benjamin/Cummings, Redwood City, CA, pp. 534-562.
47. MONTANARI, A., PERON, A. AND POLICRITI, A. 1999. Decidable theories of ω-layered metric temporal structures. Logic Journal of the IGPL 7, 1, 79-102.
48. MONTANARI, A., PERON, A. AND POLICRITI, A. 2000. The taming (timing) of the states. Logic Journal of the IGPL 8, 5, 681-699.
49. MONTANARI, A., PERON, A. AND POLICRITI, A. 2002. Extending Kamp's theorem to model time granularity. Journal of Logic and Computation 12, 641-677.
50. MONTANARI, A. AND POLICRITI, A. 1996. Decidability results for metric and layered temporal logics. Notre Dame Journal of Formal Logic 37, 260-282.
51. MONTANARI, A., SCIAVICCO, G. AND VITACOLONNA, N. 2002. Decidability of interval temporal logics over split-frames via granularity. In Proceedings of the European Conference on Logic in Artificial Intelligence. Lectures Notes on Artificial Intelligence, vol. 2424. Springer, Berlin, pp. 259-270.
52. MOSZKOWSKI, B. 1983. Reasoning about digital circuits. PhD thesis, Department of Computer Science, University of Stanford.
53. MOTA, E. AND ROBERTSON, D. 1996. Representing interaction of agents at different time granularities. In Proceedings International Workshop on Temporal Representation and Reasoning. IEEE Press, pp. 72-79.
54. NIEZETTE, M. AND STEVENNE, J. 1993. An efficient symbolic representation of periodic time. In Proceeding International Conference on Information and Knowledge Management. Lecture Notes in Computer Science, vol. 752. Springer, pp. 161-168.
55. NING, P., JAJODIA, S. AND WANG, X. S. 2002. An algebraic representation of calendars. Annals of Mathematics and Artificial Intelligence 36, 5-38.
56. POESIO, M. AND BRACHMAN, R. J. 1991. Metric constraints for maintaining appointments: Dates and repeated activities. In Proceedings of the National Conference on Artificial Intelligence. MIT Press, pp. 253-259.
57. SEGEV, A. AND CHANDRA, R. 1993. A data model for time-series analysis. In Advanced Database Systems. Lecture Notes in Computer Science 759, 191-212.
58. SHAHAR, Y. 1996. Dynamic temporal interpretation contexts for temporal abstraction. In Proceedings of the International Workshop on Temporal Representation and Reasoning. IEEE Press, pp. 64-71.
59. THOMAS, W. 1990. Automata on infinite objects. In Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, Ed. Elsevier, pp. 133-191.
60. VARDI, M. Y. AND WOLPER, P. 1986. An automata-theoretic approach to automatic program verification. In Proceedings Symposium on Logic in Computer Science. IEEE Press, Washington, DC, pp. 332-345.
61. VARDI, M. Y. AND WOLPER, P. 1994. Reasoning about infinite computations. Information and Computation 115, 1, 1-37.
62. VENEMA, Y. 1991. A modal logic for chopping intervals. Journal of Logic and Computation 1, 4, 453-476.
63. WIJSEN, J. 1998. Reasoning about qualitative trends in databases. Information Systems 23, 1, 469-493.
64. WIJSEN, J. 1999. Temporal FDs on complex objects. ACM Transactions on Database Systems 24, 1, 127-176.
65. WOLPER, P. 1983. Temporal logic can be more expressive. Information and Control 56, 1/2, 72-99.