Time granularities and ultimately periodic automata

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3229, Issue , 2004, Pages 513-525

  Bresolin, Davide ^a   Montanari, Angelo ^a   Puppis, Gabriele ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; LINEAR EQUATIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; EQUIVALENCE CLASSES; MEDICINE;

PERIODIC AUTOMATA; PERIODIC PHENOMENA; TEMPORAL INFORMATION; TIME GRANULARITIES;

KNOWLEDGE REPRESENTATION;

CLINICAL MEDICINE; EQUIVALENCE PROBLEM; KNOWLEDGE REPRESENTATION AND REASONING; MEMBERSHIP PROBLEM; PERIODIC AUTOMATA; PERIODIC PHENOMENA; TIME GRANULARITIES;

EID: 22944470544     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_43     Document Type: Conference Paper

References (18)

1. C. Bettini, S. Jajodia, and X. S. Wang. Time Granularities in Databases, Data Mining, and Temporal Reasoning. Springer, July 2000.
2. D. Bresolin, A. Montanari, and G. Puppis. Time granularities and ultimately periodic automata. Technical Report 24, Dipartimento di Matematica e Informatica, Università di Udine, Italy, October 2003.
3. J. A. Brzozowski. Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata, 12:529-561, 1962.
4. C. Campeanu, K. Culik II, K. Salomaa, and S. Yu. State complexity of basic operations on finite languages. In 4th International Workshop on Implementing Automata (WIA'99), volume 2214 of LNCS, pages 60-70. Springer, 2001.
5. C. Combi, M. Franceschet, and A. Peron. Representing and reasoning about temporal granularities. Journal of Logic and Computation, 14(1):51-77, 2004.
6. U. Dal Lago and A. Montanari. Calendars, time granularities, and automata. In 7th International Symposium on Spatial and Temporal Databases (SSTD), volume 2121 of LNCS, pages 279-298. Springer, 2001.
7. U. Dal Lago, A. Montanari, and G. Puppis. Time granularities, calendar algebra, and automata. Technical Report 4, Dipartimento di Matematica e Informatica, Università di Udine, Italy, February 2003.
8. U. Dal Lago, A. Montanari, and G. Puppis. Towards compact and tractable automaton-based representations of time granularity. In 8th Italian Conference on Theoretical Computer Science (ICTCS), volume 2841 of LNCS, pages 72-85. Springer, 2003.
9. S. Demri. LTL over integer periodicity constraints (extended abstract). In Proceedings of the 7th Int. Conf. on Foundations of Software Science and Computation Structures (FOSSACS), volume 2987 of Lecture Notes in Computer Science, pages 121-135. Springer, April 2004.
10. J. Euzenat and A. Montanari. Time granularity. In M. Fisher, D. Gabbay, and L. Vila, editors, Handbook of Temporal Reasoning in Artificial Intelligence. Elsevier, 2004.
11. M. Franceschet and A. Montanari. Time granularities in databases, data mining, and temporal reasoning, by Claudio Bettini, Sushil Jajodia, and Sean X. Wang (book review). The Computer Journal, 45(6):683-685, 2002.
12. B. Leban, D. McDonald, and D. Foster. A representation for collections of temporal intervals. In AAAI National Conference on Artificial Intelligence, volume 1, pages 367-371. AAAI Press, 1986.
13. Loma Linda University Medical Center. Pediatric heart transplantation protocol, 2002.
14. O. Matz and A. Potthoff. Computing small nondeterministic automata. In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, BRICS Notes Series, pages 74-88, 1995.
15. M. Niezette and J. Stevenne. An efficient symbolic representation of periodic time. In International Conference on Information and Knowledge Management (CIKM), pages 161-168, Baltimore, MD, 1992. ACM Press.
16. P. Ning, S. Jajodia, and X. S. Wang. An algebraic representation of calendars. Annals of Mathematics and Artificial Intelligence, 36:5-38, 2002.
17. R. Paige, R. E. Tarjan, and R. Bonic. A linear time solution to the single function coarsest partition problem. Theoretical Computer Science, 40:67-84, 1985.
18. J. Wijsen. A string-based model for infinite granularities. In C. Bettini and A. Montanari, editors, AAAI Workshop on Spatial and Temporal Granularities, pages 9-16. AAAI Press, 2000.