The Parameterized Complexity of Reasoning Problems Beyond NP

Abstract

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 problems in knowledge representation and reasoning are located at the second level of the Polynomial Hierarchy or even higher, and hence polynomial-time transformations to SAT are not… (More)

5 Figures and Tables

Topics

  • Presentations referencing similar topics