Parameterized Complexity in the Polynomial Hierarchy

Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

Ronald de Haan (Autor)

Buch | Softcover

XI, 398 Seiten

2019 | 1st ed. 2019
Springer Berlin (Verlag)
978-3-662-60669-8 (ISBN)

Artikel merken

Parameterized Complexity in the Polynomial Hierarchy was 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.

Ronald de Haan is a postdoctoral researcher at the Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam. His research interests include the application of methods from theoretical computer science-in particular methods from (parameterized) complexity theory-to problems in computational logic, artificial intelligence (AI), and knowledge representation & reasoning (KRR). He wrote his PhD thesis-titled Parameterized Complexity in the Polynomial Hierarchy-at the Algorithms and Complexity Group at the Faculty of Informatics of the Technische Universität Wien. He received his PhD in 2016. His PhD thesis was awarded the E.W. Beth Dissertation Prize 2017, was shortlisted for the Heinz Zemanek Prize 2018, and was nominated for the GI-Dissertationspreis 2016 of the German Informatics Society.

Complexity Theory and Non-determinism.- Parameterized Complexity Theory.- Fpt-Reducibility to SAT.- The Need for a New Completeness Theory.- A New Completeness Theory.- Fpt-algorithms with Access to a SAT Oracle.- Problems in Knowledge Representation and Reasoning.- Model Checking for Temporal Logics.- Problems Related to Propositional Satisfiability.- Problems in Judgment Aggregation.- Planning Problems.- Graph Problems.- Relation to Other Topics in Complexity Theory.- Subexponential-Time Reductions.- Non-Uniform Parameterized Complexity.- Open Problems and Future Research Directions.- Conclusion.- Compendium of Parameterized Problems.- Generalization to Higher Levels of the Polynomial Hierarchy.

Erscheinungsdatum	05.03.2022
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XI, 398 p. 1349 illus.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	629 g
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
	Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika
	Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
Schlagworte	answer set programming • automated reasoning • Complexity Classes • Computational Complexity • Fixed-Parameter Tractability • Fpt-reductions • parameterized complexity • Polynomial Hierarchy • SAT solving • Subexponential-time complexity • temporal logic
ISBN-10	3-662-60669-0 / 3662606690
ISBN-13	978-3-662-60669-8 / 9783662606698
Zustand	Neuware