12 problems
- 0 votes0 replies0 views
The monadic dependence characterization of fixed-parameter tractability
Let be a hereditary class of graphs. A class is monadically dependent if one cannot interpret all graphs in vertex-colored graphs from the class using a fixed first-…
- 0 votes0 replies0 views
Fixed-parameter tractability of first-order model checking on hereditary dependent classes
Dependence conjecture. First-order model checking is fixed-parameter tractable on every hereditary dependent class of graphs.
- 0 votes0 replies1 view
The merge-width characterization of monadic dependence
Let be a hereditary graph class. Say that has almost bounded merge-width if, for every fixed , the radius- merge-width of its -v…
- 0 votes0 replies1 view
The monadic NIP characterization of fixed-parameter tractable model checking
Monadic NIP characterization. First-order model checking is fixed-parameter tractable on if and only if has monadic NIP; for hereditary classes of rel…
- 0 votes0 replies0 views
Intractability beyond independent hereditary TOWS classes
A class of relational structures is independent when it has the relevant independence property, and it is hereditary when it is closed under induced substructures. A TOWS graph is…
- 0 votes0 replies0 views
FO model-checking conjecture for dependent hereditary graph classes
FO model-checking conjecture. First-Order model checking is fixed-parameter tractable on if and only if is dependent.
- 0 votes0 replies0 views
Fixed-parameter tractability of first-order model checking on monadically dependent classes
The monadic dependence model-checking conjecture. For every monadically dependent class there is a constant and an algorithm that, given a graph…
- 0 votes0 replies0 views
Bounded-rank characterization by bounded alternation rank
Let be a hereditary graph class. Bounded-rank alternation conjecture. The class has bounded rank if and only if there is such that every first-order fo…
- 0 votes0 replies0 views
Pilipczuk–Toruńczyk's rank conjecture for elementarily-fpt model checking
Let be a hereditary graph class. For , let denote the class of all trees of depth . Pilipczuk–Toruńczyk's rank conjecture. The class has elemen…
- 0 votes0 replies0 views
Tractable model-checking conjecture for conditional strategic reasoning
Let be the logic for conditional local strategic reasoning introduced in the paper, and consider the problem of deciding whether a formula i…
- 0 votes0 replies1 view
The folklore conjecture on first-order model checking in interpretations of bounded-expansion classes
Let be a graph class with bounded expansion, let be a simple first-order graph interpretation scheme, and let be a first-order property to be tested. Th…
- 0 votes0 replies0 views
Decidability of the modal mu-calculus on nested pushdown trees
Let the higher-order nested pushdown tree hierarchy consist of nested pushdown trees at all finite levels, equipped with their tree structure and jump relations. The modal -ca…