Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...