About this book
The book presents the co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy (PH). For problems at higher levels of the PH, a promising solving approach is to develop fixed-parameter tractable reductions to SAT, and to subsequently use a SAT solving algorithm to solve the problem. In this dissertation, a theoretical toolbox is developed that can be used to classify in which cases this is possible. The use of this toolbox is illustrated by applying it to analyze a wide range of problems from various areas of computer science and artificial intelligence.
Computational complexity Parameterized complexity Fixed-parameter tractability Fpt-reductions Polynomial Hierarchy Complexity classes Automated reasoning SAT solving Answer set programming Subexponential-time complexity Temporal logic
Springer-Verlag GmbH Germany, part of Springer Nature 2019
Springer, Berlin, Heidelberg
Series Print ISSN
Series Online ISSN
Buy this book on publisher's site