50 search results - page 3 / 10 » Fragments of First-Order Logic over Infinite Words |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
104
click to vote
DAWAK
2007
Springer
15 years 3 months ago
2007
Springer
Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of fir...
CSL
2006
Springer
14 years 11 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
FOSSACS
2006
Springer
15 years 3 months ago
2006
Springer
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it ...