aaai98

aaai 2016 论文列表

Beyond NP, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 12, 2016.

Knowledge Compilation and Weighted Model Counting for Inference in Probabilistic Logic Programs.
Factorized Databases: A Knowledge Compilation Perspective.
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving.
Toward Caching Symmetrical Subtheories for Weighted Model Counting.
Exploiting the Hidden Structure of Junction Trees for MPE.
Lazy Arithmetic Circuits.
Non-CNF QBF Solving with QCIR.
SlimShot: Probabilistic Inference for Web-Scale Knowledge Bases.
Solving QBF Instances with Nested SAT Solvers.
Subset Minimization in Dynamic Programming on Tree Decompositions.
Extension Variables in QBF Resolution.
Satisfiability and Model Counting in Open Universes.
Clauses Versus Gates in CEGAR-Based 2QBF Solving.
Preface: The Beyond NP Workshop.