50 search results - page 7 / 10 » Fragments of First-Order Logic over Infinite Words |
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
KES
2004
Springer
15 years 2 months ago
2004
Springer
ConceptNet is a very large semantic network of commonsense knowledge suitable for making various kinds of practical inferences over text. ConceptNet captures a wide range of common...
LICS
1998
IEEE
15 years 1 months ago
1998
IEEE
d abstract) T. Eiter G. Gottlob Y. Gurevich Institut fur Informatik Institut fur Informationssysteme EECS Department Universitat Gie en Technische Universitat Wien University of Mi...
AICOM
2010
14 years 9 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...