Abstract Knowledge compilation is a compelling technique for dealing with the intractability
of propositional reasoning. One particularly effective target language is Deterministic …

The sentential decision diagram (SDD) has been recently proposed as a new tractable
representation of Boolean functions that generalizes the influential ordered binary decision …

We introduce in this paper two new, complete propositional languages and study their
properties in terms of (1) their support for polytime operations and (2) their ability to …

Abstract Model counting is the task of computing the number of assignments to variables V
that satisfy a given propositional theory F. The model counting problem is denoted as# SAT …

This paper is concerned with a class of algorithms that perform exhaustive search on
propositional knowledge bases. We show that each of these algorithms defines and …

In this work, we study the d-Hitting Set and Feedback Vertex Set problems through the
paradigm of finding diverse collections of r solutions of size at most k each, which has …

The world is unpredictable, and acting intelligently requires anticipating possible
consequences of actions that are taken. Assuming that the actions and the world are …

We show that the trace of an exhaustive DPLL search can be viewed as a compilation of the
propositional theory. With different constraints imposed or lifted on the DPLL algorithm, this …

Abstract Knowledge compilation is a powerful reasoning paradigm with many applications
across AI and computer science more broadly. We consider the problem of bottom-up …

Given a set of constraints F and a user-defined weight function W on the assignment space,
the problem of constrained sampling is to sample satisfying assignments of F conditioned on …