50 search results - page 2 / 10 » Fragments of First-Order Logic over Infinite Words |
102
click to vote
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
CIE
2008
Springer
14 years 9 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
117
click to vote
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...