Beyond NP
Papers from the 2016 AAAI Workshop
Adnan Darwiche, Chair
AAAI Technical Report WS-16-05
This technical report was published as part of The Workshops of the Thirtieth AAAI Conference on Artificial Intelligence: Technical Reports WS-16-01 – WS-16-15 by The AAAI Press, Palo Alto, California
Contents
Preface: The Beyond NP Workshop
Adnan Darwiche, Joao Marquest-Silva, Pierre Marquis
Clauses Versus Gates in CEGAR-Based 2QBF Solving
Valeriy Balabanov, Jie-Hong Roland Jiang, Alan Mishchenko, Christoph Scholl
Satisfiability and Model Counting in Open Universes
Vaishak Belle
Extension Variables in QBF Resolution
Olaf Beyersdorf, Leroy Chew, Mikolas Janota
Subset Minimization in Dynamic Programming on Tree Decompositions
Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran
Solving QBF Instances with Nested SAT Solvers
Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi
SlimShot: Probabilistic Inference for Web-Scale Knowledge Bases
Eric Gribkoff, Dan Suciu
Non-CNF QBF Solving with QCIR
Charles Jordan, Will Klieber, Martina Seidl
Lazy Arithmetic Circuits
Seyed Mehran Kazemi, David Poole
Exploiting the Hidden Structure of Junction Trees for MPE
Batya Kenig, Avigdor Gal
Toward Caching Symmetrical Subtheories for Weighted Model Counting
Timothy Kopp, Parag Singla, Henry Kautz
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Kuldeep S. Meel, Moshe Y. Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, Sharad Malik
Factorized Databases: A Knowledge Compilation Perspective
Dan Olteanu
Knowledge Compilation and Weighted Model Counting for Inference in Probabilistic Logic Programs
Jonas Vlasselaer, Angelika Kimmig, Anton Dries, Wannes Meert, Luc De Raedt
AAAI Digital Library
AAAI relies on your generous support through membership and donations. If you find these resources useful, we would be grateful for your support.