On the relation between structured d-DNNFs and SDDs

12/02/2019
by   Beate Bollig, et al.
0

Structured d-DNNFs and SDDs are restricted negation normal form circuits used in knowledge compilation as target languages into which propositional theories are compiled. Structuredness is imposed by so-called vtrees. By definition SDDs are restricted structured d-DNNFs. Beame and Liew (2015) as well as Bova and Szeider (2017) mentioned the question whether structured d-DNNFs are really more general than SDDs w.r.t. polynomial-size representations (w.r.t. the number of Boolean variables the represented functions are defined on.) The main result in the paper is the proof that a function can be represented by SDDs of polynomial size if the function and its complement have polynomial-size structured d-DNNFs that respect the same vtree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2018

On the Relative Succinctness of Sentential Decision Diagrams

Sentential decision diagrams (SDDs) introduced by Darwiche in 2011 are a...
research
05/02/2020

On P Versus NP

I generalize a well-known result that P = NP fails for monotone polynomi...
research
02/12/2021

Proof complexity of positive branching programs

We investigate the proof complexity of systems based on positive branchi...
research
12/16/2009

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions

Abduction is a fundamental and important form of non-monotonic reasoning...
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
07/15/2021

Lossy Kernelization of Same-Size Clustering

In this work, we study the k-median clustering problem with an additiona...

Please sign up or login with your details

Forgot password? Click here to reset