DeepAI AI Chat
Log In Sign Up

Propagation complete encodings of smooth DNNF theories

by   Petr Kučera, et al.
Akademie věd ČR
Charles University in Prague

We investigate conjunctive normal form (CNF) encodings of a function represented with a smooth decomposable negation normal form (DNNF). Several encodings of DNNFs and decision diagrams were considered by (Abio et al. 2016). The authors differentiate between encodings which implement consistency or domain consistency from encodings which implement unit refutation completeness or propagation completeness (in both cases implements means by unit propagation). The difference is that in the former case we do not care about properties of the encoding with respect to the auxiliary variables while in the latter case we treat all variables (the input ones and the auxiliary ones) in the same way. The latter case is useful if a DNNF is a part of a problem containing also other constraints and a SAT solver is used to test satisfiability. The currently known encodings of smooth DNNF theories implement domain consistency. Building on this and the result of (Abio et al. 2016) on an encoding of decision diagrams which implements propagation completeness, we present a new encoding of a smooth DNNF which implements propagation completeness. This closes the gap left open in the literature on encodings of DNNFs.


page 1

page 2

page 3

page 4


Completeness of Nominal PROPs

We introduce nominal string diagrams as string diagrams internal in the ...

Some Remarks on Boolean Constraint Propagation

We study here the well-known propagation rules for Boolean constraints. ...

Core First Unit Propagation

Unit propagation (which is called also Boolean Constraint Propagation) h...

On SAT representations of XOR constraints

We study the representation of systems S of linear equations over the tw...

Generalising unit-refutation completeness and SLUR via nested input resolution

We introduce two hierarchies of clause-sets, SLUR_k and UC_k, based on t...

A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints

Two major considerations when encoding pseudo-Boolean (PB) constraints i...

Measuring the Completeness of Theories

We use machine learning to provide a tractable measure of the amount of ...