212 search results - page 2 / 43 » Complexity Parameters for First-Order Classes |
CSL
2009
Springer
13 years 8 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
SIAMJO
2008
13 years 4 months ago
2008
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
PODS
2004
ACM
14 years 5 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
LICS
1999
IEEE
13 years 9 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...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...