A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Time Granularities and Ultimately Periodic Automata
[chapter]
2004
Lecture Notes in Computer Science
The relevance of the problem of managing periodic phenomena is widely recognized in the area of knowledge representation and reasoning. One of the most effective attempts at dealing with this problem has been the addition of a notion of time granularity to knowledge representation systems. Different formalizations of such a notion have been proposed in the literature, following algebraic, logical, string-based, and automaton-based approaches. In this paper, we focus our attention on the
doi:10.1007/978-3-540-30227-8_43
fatcat:wtphljtfyreina5aqzdfniugd4