DeepAI AI Chat
Log In Sign Up

On the Role of Canonicity in Bottom-up Knowledge Compilation

by   Guy Van den Broeck, et al.

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.


page 1

page 2

page 3

page 4


Decision problems for Clark-congruential languages

A common question when studying a class of context-free grammars is whet...

Belief Revision in Sentential Decision Diagrams

Belief revision is the task of modifying a knowledge base when new infor...

On q-nearly bent Boolean functions

For each non-constant Boolean function q, Klapper introduced the notion ...

Learning from Satisfying Assignments Using Risk Minimization

In this paper we consider the problem of Learning from Satisfying Assign...

BDDs Naturally Represent Boolean Functions, and ZDDs Naturally Represent Sets of Sets

This paper studies a difference between Binary Decision Diagrams (BDDs) ...

Decision Diagrams for Quantum Measurements with Shallow Circuits

We consider the problem of estimating quantum observables on a collectio...