default search action
AAAI Workshop: Beyond NP 2016: Phoenix, Arizona, USA
- Adnan Darwiche:
Beyond NP, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 12, 2016. AAAI Technical Report WS-16-05, AAAI Press 2016 - Adnan Darwiche, João Marques-Silva, Pierre Marquis:
Preface: The Beyond NP Workshop. - Valeriy Balabanov, Jie-Hong Roland Jiang, Alan Mishchenko, Christoph Scholl:
Clauses Versus Gates in CEGAR-Based 2QBF Solving. - Vaishak Belle:
Satisfiability and Model Counting in Open Universes. - Olaf Beyersdorff, Leroy Chew, Mikolas Janota:
Extension Variables in QBF Resolution. - Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran:
Subset Minimization in Dynamic Programming on Tree Decompositions. - Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi:
Solving QBF Instances with Nested SAT Solvers. - Eric Gribkoff, Dan Suciu:
SlimShot: Probabilistic Inference for Web-Scale Knowledge Bases. - Charles Jordan, Will Klieber, Martina Seidl:
Non-CNF QBF Solving with QCIR. - Seyed Mehran Kazemi, David Poole:
Lazy Arithmetic Circuits. - Batya Kenig, Avigdor Gal:
Exploiting the Hidden Structure of Junction Trees for MPE. - Timothy Kopp, Parag Singla, Henry A. Kautz:
Toward Caching Symmetrical Subtheories for Weighted Model Counting. - Kuldeep S. Meel, Moshe Y. Vardi, Supratik Chakraborty, Daniel J. Fremont, Sanjit A. Seshia, Dror Fried, Alexander Ivrii, Sharad Malik:
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving. - Dan Olteanu:
Factorized Databases: A Knowledge Compilation Perspective. - Jonas Vlasselaer, Angelika Kimmig, Anton Dries, Wannes Meert, Luc De Raedt:
Knowledge Compilation and Weighted Model Counting for Inference in Probabilistic Logic Programs.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.