# Model-checking problems as a basis for parameterized intractability

@article{Flum2004ModelcheckingPA, title={Model-checking problems as a basis for parameterized intractability}, author={J{\"o}rg Flum and Martin Grohe}, journal={Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.}, year={2004}, pages={388-397} }

Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem. For example, Downey and Fellow's W-hierarchy is of this form. But there are also classes, for example, the A-hierarchy, that are more naturally characterised in terms of model-checking problems for fragments of first-order logic. R. G. Downey et al. (1998) were the first to establish a connection between the two formalisms by…

## Figures from this paper

## 20 Citations

The complexity of first-order and monadic second-order logic revisited

- Computer ScienceProceedings 17th Annual IEEE Symposium on Logic in Computer Science
- 2002

It is shown that unless PTIME=NP, the model-checking problem for monadic second-order logic on finite words is not solvable in time f(k)/spl middot/p(n), for any elementary function f and any polynomial p, and under an assumption from parameterized complexity theory.

Model-checking problems, machines and parameterized complexity

- Computer Science
- 2004

The parameterized complexity, which is a refined complexity theory to deal with two-dimensional languages in which one part of the input instances, or parameter, is expected to be far smaller than the other, centers on a novel concept of tractability, i.e., fixed-parameter tractability.

An analysis of the W*-hierarchy

- MathematicsJournal of Symbolic Logic
- 2007

Abstract We observe that the W*-hierarchy, a variant (introduced by Downey, Fellows, and Taylor [7]) of the better known W-hierarchy, coincides with the W-hierarchy, though not level wise, but just…

Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits

- Computer Science, MathematicsICALP
- 2004

A notion of bounded fixed-parameter tractability, where the dependence of the running time on the parameter is restricted to be singly exponential, is proposed.

Hard Problems on Random Graphs

- Mathematics, Computer ScienceICALP
- 2020

It is shown that it is indeed unlikely that Dominating Set can be solved efficiently on random graphs, and whether a graph contains a clique or a dominating set of size k is shown, if yes, then every first-order expressible graph property can be solve in expected FPT time.

Bounded fixed-parameter tractability and log2n nondeterministic bits

- Computer Science, MathematicsJ. Comput. Syst. Sci.
- 2006

A multiparametric view on answer set programming

- Computer ScienceAnnals of Mathematics and Artificial Intelligence
- 2019

This paper considers several natural parameters for the consistency problem of disjunctive ASP and shows several novel fixed-parameter tractability (fpt) results based on combinations of parameters.

A parametric analysis of the state-explosion problem in model checking

- Computer ScienceJ. Comput. Syst. Sci.
- 2006

Bounded Fixed-Parameter Tractability: The Case 2poly(k)

- Mathematics, Computer ScienceIWPEC
- 2004

In this course the PW-hierarchy is defined, some complete problems are provided, and each of its classes is characterized in terms of model-checking problems, in Terms of propositional satisfiability problems,In terms of logical definitions, and by machine models.

On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs

- Computer ScienceACM Trans. Comput. Theory
- 2018

It is proved that computations on tree-depth decompositions correspond to a model of non-deterministic machines that work in polynomial time and logarithmic space, with access to an auxiliary stack of maximum height equal to the decomposition’s depth.

## References

SHOWING 1-10 OF 29 REFERENCES

Fixed-Parameter Tractability, Definability, and Model-Checking

- Mathematics, Computer ScienceSIAM J. Comput.
- 2001

This article proves an equivalence between model-checking for first-order formulas with t quantifier alternations and the parameterized halting problem for alternating Turing machines with t alternations, and gives a characterization of the class FPT of all fixed-parameter tractable problems in terms of slicewise definability in finite variable least fixed-point logic.

Descriptive complexity and the W hierarchy

- MathematicsProof Complexity and Feasible Arithmetics
- 1996

It is proved that for each t ≥ 1, W [t] equals the closure under fixed-parameter reductions of the class of languages L definable by formulas of the form φ = (∃U)ψ, where U is a set variable and ψ is a first-order formula in ∏ t prenex form.

The complexity of first-order and monadic second-order logic revisited

- Computer ScienceProceedings 17th Annual IEEE Symposium on Logic in Computer Science
- 2002

It is shown that unless PTIME=NP, the model-checking problem for monadic second-order logic on finite words is not solvable in time f(k)/spl middot/p(n), for any elementary function f and any polynomial p, and under an assumption from parameterized complexity theory.

Fixed-Parameter Tractability and Completeness I: Basic Results

- MathematicsSIAM J. Comput.
- 1995

This paper establishes the main results of a completeness program which addresses the apparent fixed-parameter intractability of many parameterized problems and gives a compendium of currently known hardness results.

Query evaluation via tree-decompositions

- Computer ScienceJACM
- 2002

It is shown that the acyclic and bounded tree-width fragments have the same expressive power as the well-known guarded fragment and the finite-variable fragments of first-order logic, respectively.

Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues

- MathematicsAnn. Pure Appl. Log.
- 1995

The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1]

- Computer ScienceDMTCS
- 1996

The main results show: (1) the general problem is complete for the parametric complexity class AW [∗], and (2) when restricted to monotone queries, the problem iscomplete for the fundamental parametric simplicity class W [1].

Generalized first-order spectra, and polynomial. time recognizable sets

- Mathematics
- 1974

The spectrum of a first-order sentence σ is the set of cardinalities of its finite models. Jones and Selman showed that a set C of numbers (written in binary) is a spectrum if and only if C is in the…

Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]

- MathematicsTheor. Comput. Sci.
- 1995