Abstract argumentation frameworks (AFs) provide the basis for various reasoning problems
in the area of Artificial Intelligence. Efficient evaluation of AFs has thus been identified as an …

In this paper we take a closer look at the parameterized complexity of\exists\forall SAT, the
prototypical complete problem of the class Sigma_2^ p, the second level of the polynomial …

We study the problem of finding a Pareto-efficient and envy-free allocation of a set of
indivisible resources to a set of agents with monotonic preferences, either dichotomous or …

Lifting a recent proposal by Moreno-Centeno and Karp, we propose a general framework for
so-called implicit hitting set algorithms for reasoning beyond NP. The framework is motivated …

Propositional Satisfiability (SAT) solvers are routinely used for solving many function
problems. A natural question that has seldom been addressed is: what is the number of calls …

The main reasoning problems for disjunctive logic programs are complete for the second
level of the polynomial hierarchy and hence considered harder than the same problems for …

Parameterized Complexity in the Polynomial Hierarchy Page 1 Ronald de Haan LNCS
11880 Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy …

We present a list of parameterized problems together with a complexity classification of
whether they allow a fixed-parameter tractable reduction to SAT or not. These problems are …

Today's propositional satisfiability (SAT) solvers are extremely powerful and can be used as
an efficient back-end for solving NP-complete problems. However, many fundamental …

Many problems arising in computational social choice are of high computational complexity,
and some are located at higher levels of the Polynomial Hierarchy. We argue that a …