Connecting Knowledge Compilation Classes and Width Parameters

11/07/2018
by   Antoine Amarilli, et al.
0

The field of knowledge compilation establishes the tractability of many tasks by studying how to compile them to Boolean circuit classes obeying some requirements such as structuredness, decomposability, and determinism. However, in other settings such as intensional query evaluation on databases, we obtain Boolean circuits that satisfy some width bounds, e.g., they have bounded treewidth or pathwidth. In this work, we give a systematic picture of many circuit classes considered in knowledge compilation and show how they can be systematically connected to width measures, through upper and lower bounds. Our upper bounds show that bounded-treewidth circuits can be constructively converted to d-SDNNFs, in time linear in the circuit size and singly exponential in the treewidth; and that bounded-pathwidth circuits can similarly be converted to uOBDDs. We show matching lower bounds on the compilation of monotone DNF or CNF formulas to structured targets, assuming a constant bound on the arity (size of clauses) and degree (number of occurrences of each variable): any d-SDNNF (resp., SDNNF) for such a DNF (resp., CNF) must be of exponential size in its treewidth, and the same holds for uOBDDs (resp., n-OBDDs) when considering pathwidth. Unlike most previous work, our bounds apply to any formula of this class, not just a well-chosen family. Hence, we show that pathwidth and treewidth respectively characterize the efficiency of compiling monotone DNFs to uOBDDs and d-SDNNFs with compilation being singly exponential in the corresponding width parameter. We also show that our lower bounds on CNFs extend to unstructured compilation targets, with an exponential lower bound in the treewidth (resp., pathwidth) when compiling monotone CNFs of constant arity and degree to DNNFs (resp., nFBDDs).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2017

Connecting Width and Structure in Knowledge Compilation

Several query evaluation tasks can be done via knowledge compilation: th...
research
09/18/2017

Connecting Width and Structure in Knowledge Compilation (Extended Version)

Several query evaluation tasks can be done via knowledge compilation: th...
research
05/01/2023

An Approach to Circuit Lower Bounds via Bounded Width Circuits

In this paper, we investigate an approach to circuit lower bounds via bo...
research
01/06/2022

The splitting power of branching programs of bounded repetition and CNFs of bounded width

In this paper we study syntactic branching programs of bounded repetitio...
research
04/15/2022

Twin-width can be exponential in treewidth

For any small positive real ε and integer t > 1/ε, we build a graph with...
research
02/13/2021

Lower Bounds on Dynamic Programming for Maximum Weight Independent Set

We prove lower bounds on pure dynamic programming algorithms for maximum...
research
09/04/2022

The Approximate Degree of DNF and CNF Formulas

The approximate degree of a Boolean function f{0,1}^n→{0,1} is the minim...

Please sign up or login with your details

Forgot password? Click here to reset