7 search results - page 1 / 2 » Definability and decidability of binary predicates for time ... |
JAPLL
2006
13 years 5 months ago
2006
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures...
ICDT
1995
ACM
13 years 8 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
MICRO
2005
IEEE
13 years 10 months ago
2005
IEEE
Predicated execution has been used to reduce the number of branch mispredictions by eliminating hard-to-predict branches. However, the additional instruction overhead and addition...
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
FORMATS
2008
Springer
13 years 6 months ago
2008
Springer
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...