Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Languages, automata, and logic
Handbook of formal languages, vol. 3
Time Granularities in Databases, Data Mining and Temporal Reasoning
Time Granularities in Databases, Data Mining and Temporal Reasoning
A general framework for time granularity and its application to temporal reasoning
Annals of Mathematics and Artificial Intelligence
Symbolic representation of user-defined time granularities
Annals of Mathematics and Artificial Intelligence
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
LTL Over integer periodicity constraints
Theoretical Computer Science
Compact and tractable automaton-based representations of time granularities
Theoretical Computer Science
Verification of qualitative Z constraints
Theoretical Computer Science
Supporting temporal reasoning by mapping calendar expressions to minimal periodic sets
Journal of Artificial Intelligence Research
Intelligent visualization and exploration of time-oriented data of multiple patients
Artificial Intelligence in Medicine
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Multi-granularity and metric spatial reasoning
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, temporal data conversion, temporal database inter-operability, temporal constraint reasoning, data mining, and time management in workflow systems. According to a commonly accepted view, any time granularity can be viewed as the partitioning of a temporal domain in groups of elements, where each group is perceived as an indivisible unit (a granule). Most granularities of practical interest are modeled as infinite sequences of time granules, that present a repeating pattern and, possibly, temporal gaps within and between granules. Even though conceptually clean, this definition does not address the problem of providing infinite granularities with a finite representation to make it possible to deal with them in an effective way. In this paper, we present an automata-theoretic solution to such a problem that revises and extends the string-based model recently proposed by Wijsen [13]. We illustrate the basic features of our formalism and discuss its application to the fundamental problems of equivalence and classification of time granularities.