Abstract is missing.
- SlimShot: Probabilistic Inference for Web-Scale Knowledge BasesEric Gribkoff, Dan Suciu. [doi]
- Factorized Databases: A Knowledge Compilation PerspectiveDan Olteanu. [doi]
- Clauses Versus Gates in CEGAR-Based 2QBF SolvingValeriy Balabanov, Jie-Hong Roland Jiang, Alan Mishchenko, Christoph Scholl. [doi]
- Extension Variables in QBF ResolutionOlaf Beyersdorff, Leroy Chew, Mikolas Janota. [doi]
- Constrained Sampling and Counting: Universal Hashing Meets SAT SolvingKuldeep S. Meel, Moshe Y. Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, Sharad Malik. [doi]
- Knowledge Compilation and Weighted Model Counting for Inference in Probabilistic Logic ProgramsJonas Vlasselaer, Angelika Kimmig, Anton Dries, Wannes Meert, Luc De Raedt. [doi]
- Solving QBF Instances with Nested SAT SolversBart Bogaerts 0001, Tomi Janhunen, Shahab Tasharrofi. [doi]
- Satisfiability and Model Counting in Open UniversesVaishak Belle. [doi]
- Toward Caching Symmetrical Subtheories for Weighted Model CountingTimothy Kopp, Parag Singla, Henry A. Kautz. [doi]
- Subset Minimization in Dynamic Programming on Tree DecompositionsBernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran. [doi]
- Non-CNF QBF Solving with QCIRCharles Jordan, Will Klieber, Martina Seidl. [doi]
- Lazy Arithmetic CircuitsSeyed Mehran Kazemi, David Poole. [doi]
- Exploiting the Hidden Structure of Junction Trees for MPEBatya Kenig, Avigdor Gal. [doi]
- Preface: The Beyond NP WorkshopAdnan Darwiche, Joao Marques-Silva, Pierre Marquis. [doi]