Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
From MaRDI portal
Publication:2999097
DOI10.3233/978-1-60750-606-5-3zbMath1211.68439OpenAlexW1626843795MaRDI QIDQ2999097
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
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Boolean functions (06E30) Data structures (68P05)
Related Items (4)
On Compiling CNFs into Structured Deterministic DNNFs ⋮ On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) ⋮ A generic framework for a compilation-based inference in probabilistic and possibilistic networks ⋮ On the relation between structured \(d\)-DNNFs and SDDs
This page was built for publication: Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
