Beyond NP
Papers
Preface: The Beyond NP Workshop
PDFClauses Versus Gates in CEGAR-Based 2QBF Solving
PDFSatisfiability and Model Counting in Open Universes
PDFExtension Variables in QBF Resolution
PDFSubset Minimization in Dynamic Programming on Tree Decompositions
PDFSolving QBF Instances with Nested SAT Solvers
PDFSlimShot: Probabilistic Inference for Web-Scale Knowledge Bases
PDFNon-CNF QBF Solving with QCIR
PDFLazy Arithmetic Circuits
PDFExploiting the Hidden Structure of Junction Trees for MPE
PDFToward Caching Symmetrical Subtheories for Weighted Model Counting
PDFConstrained Sampling and Counting: Universal Hashing Meets SAT Solving
PDFFactorized Databases: A Knowledge Compilation Perspective
PDFKnowledge Compilation and Weighted Model Counting for Inference in Probabilistic Logic Programs
PDF