In practice, feature models often have up-to thousands of features and, thus, are typically
infeasible to analyze manually. Hence, many different analyses have been proposed which …

The theory of arithmetic is integral to many uses of SMT solvers. Z3 has implemented native
solvers for arithmetic reasoning since its first release. We present a full re-implementation of …

Abstract The Zero-suppressed Sentential Decision Diagram (ZSDD) is a recentlydiscovered
tractable representation of Boolean functions. ZSDD subsumes theZero-suppressed Binary …

Modular combination of theory solvers is an integral theme in engineering modern SMT
solvers. The CDCL (T) architecture provides an overall setting for how theory solvers may …

Visual reasoning is essential for building intelligent agents that understand the world and
perform problem-solving beyond perception. Differentiable forward reasoning has been …

Abstract Recently, the Probabilistic Sentential Decision Diagram (PSDD) has been
proposed as a framework for systematically inducing and learning distributions over …

In this paper, we propose a new method to compile $ s $-$ t $ simple paths on a graph using
a new compilation method called merging frontier based search. Recently, Nishino et al …

Abstract Probabilistic Sentential Decision Diagrams (PSDDs) are effective tools for
combining uncertain knowledge in the form of (learned) probabilities and certain knowledge …

Constraint programming is a powerful paradigm for solving combinatorial problems.
Diagnosis, planning, and product configuration, are example use-cases. While reasoning …

We demonstrate the viability of symbolic model checking using Sentential Decision
Diagrams (SDD), in lieu of the more common Binary Decision Diagram (BDD). The SDD …