Connecting Width and Structure in Knowledge Compilation

09/18/2017
by   Antoine Amarilli, et al.
0

Several query evaluation tasks can be done via knowledge compilation: the query result is compiled as a lineage circuit from which the answer can be determined. For such tasks, it is important to leverage some width parameters of the circuit, such as bounded treewidth or pathwidth, to convert the circuit to structured classes, e.g., deterministic structured NNFs (d-SDNNFs) or OBDDs. In this work, we show how to connect the width of circuits to the size of their structured representation, through upper and lower bounds. For the upper bound, we show how bounded-treewidth circuits can be converted to a d-SDNNF, in time linear in the circuit size. Our bound, unlike existing results, is constructive and only singly exponential in the treewidth. We show a related lower bound on monotone CNF or DNF formulas, assuming a constant bound on the arity (size of clauses) and degree (number of occurrences of each variable). Specifically, any d-SDNNF for such a formula must be of exponential size in its treewidth; and the same holds for pathwidth when compiling to OBDDs. Our lower bounds, in contrast with most previous work, apply to any formula of this class, not just a well-chosen family. Hence, for our language of CNF and DNF, pathwidth and treewidth respectively characterize the efficiency of compiling to OBDDs and d-SDNNFs, that is, compilation is singly exponential in the corresponding width parameter. We conclude by applying our lower bound results to the task of query evaluation.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
11/07/2018

Connecting Knowledge Compilation Classes and Width Parameters

The field of knowledge compilation establishes the tractability of many ...
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
07/11/2018

Knowledge Compilation, Width and Quantification

We generalize many results concerning the tractability of SAT and #SAT o...
research
12/23/2021

Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation

Bottom-up knowledge compilation is a paradigm for generating representat...
research
09/26/2017

Partial matching width and its application to lower bounds for branching programs

We introduce a new structural graph parameter called partial matching wi...
research
08/05/2020

Constant Congestion Brambles

A bramble in an undirected graph G is a family of connected subgraphs of...

Please sign up or login with your details

Forgot password? Click here to reset