Sciweavers

AAAI
2010
13 years 9 months ago
A Lower Bound on the Size of Decomposable Negation Normal Form
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
Thammanit Pipatsrisawat, Adnan Darwiche
ISMIS
2005
Springer
14 years 5 months ago
Normal Forms for Knowledge Compilation
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
Reiner Hähnle, Neil V. Murray, Erik Rosenthal