Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected...
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
Computer science has long been considered to emphasize three distinct perspectives: mathematics, science, and engineering. While the database field has some very strong mathemati...
Forty-four relations are found between an interval and an interval with a gap ( rIIg ), capturing semantics that are distinct from those of the sets of constituting intervals and ...
This paper describes an annotation guideline for a temporal relation-tagged corpus of Chinese. Our goal is construction of corpora to be used for a corpus-based analysis of tempor...
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
Alessandro Artale, Roman Kontchakov, Carsten Lutz,...