On the Role of Canonicity in Bottom-up Knowledge Compilation

We consider the problem of bottom-up compilation of knowledge bases, which is usually predicated on the existence of a polytime function for combining compilations using Boolean operators (usually called an Apply function). While such a polytime Apply function is known to exist for certain languages (e.g., OBDDs) and not exist for others (e.g., DNNF), its existence for certain languages remains unknown. Among the latter is the recently introduced language of Sentential Decision Diagrams (SDDs), for which a polytime Apply function exists for unreduced SDDs, but remains unknown for reduced ones (i.e. canonical SDDs). We resolve this open question in this paper and consider some of its theoretical and practical implications. Some of the findings we report question the common wisdom on the relationship between bottom-up compilation, language canonicity and the complexity of the Apply function.

[1]  Adnan Darwiche,et al.  New Compilation Languages Based on Structured Decomposability , 2008, AAAI.

[2]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[3]  Adnan Darwiche,et al.  Dynamic Minimization of Sentential Decision Diagrams , 2013, AAAI.

[4]  Adnan Darwiche,et al.  Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence SDD: A New Canonical Representation of Propositional Knowledge Bases , 2022 .

[5]  Adnan Darwiche,et al.  Basing Decisions on Sentences in Decision Diagrams , 2012, AAAI.

[6]  Manfred Jaeger,et al.  Compiling relational Bayesian networks for exact inference , 2006, Int. J. Approx. Reason..

[7]  Luc De Raedt,et al.  Inference in Probabilistic Logic Programs using Weighted CNF's , 2011, UAI.

[8]  William Wernick.  Complete sets of logical functions , 1942 .

[9]  Bart Selman,et al.  Knowledge compilation and theory approximation , 1996, JACM.

[10]  Prasoon Goyal,et al.  Probabilistic Databases , 2009, Encyclopedia of Database Systems.

[11]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[12]  Adnan Darwiche,et al.  Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams , 2013, ECSQARU.

[13]  Blai Bonet,et al.  Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations , 2005, ICAPS.

[14]  Brian C. Williams,et al.  DNNF-based Belief State Estimation , 2006, AAAI.

[15]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..