Top-down algorithms for constructing structured DNNF: theoretical and practical implications

DOI10.3233/978-1-60750-606-5-3MaRDI QIDQ2999097zbMATH OpenOpenAlexFDO

Authors Knot Pipatsrisawat, Adnan Darwiche

Publication date 11 May 2011

Full work available at URL http://reasoning.cs.ucla.edu/fetch.php?id=113&type=pdf

Mathematics Subject Classification ID

Data structures (68P05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Boolean functions (06E30)

Recommendations

• On compiling CNFs into structured deterministic DNNFs
• On the relation between structured \(d\)-DNNFs and SDDs
• Decomposable negation normal form
• On limitations of structured (deterministic) DNNFs
• Connecting width and structure in knowledge compilation

Cited in

(6)

• On compiling CNFs into structured deterministic DNNFs
• On limitations of structured (deterministic) DNNFs
• On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
• On the relation between structured \(d\)-DNNFs and SDDs
• A generic framework for a compilation-based inference in probabilistic and possibilistic networks
• DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF

This page was built for publication: Top-down algorithms for constructing structured DNNF: theoretical and practical implications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999097)