Decomposable negation normal form

By Adnan Darwiche. JACM, 2001

427 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

New Advances in Compiling CNF into Decomposable Negation Normal Form (2004, methodology): “The compiler given in [4, 5] uses the identity of variable instantiations γ andγ′ as the key to the cache.”
Compiling Combinatorial Prediction Games (2018, methodology): “As shown in (Darwiche, 2001), any Boolean circuitC can be transformed in to an equivalent smooth NNF circuit of size linear in |C|.”
A Symbolic Approach to Explaining Bayesian Network Classifiers (2018, methodology): “The operation of i -minimization can also be performed in time linear in the size of f using the technique given in [Darwiche, 2001] for DNNFs.”
A Knowledge Compilation Map (2002, methodology): “The NNF Language We consider more than a dozen languages in this paper, all of which are subsets of the NNF language, which is defined formally as follows (Darwiche, 1999, 2001a).”
Three Modern Roles for Logic in AI (2020, background): “The satisfiability of DNNF circuits can be decided in time linear in the circuit size [22].”
Learning Bayesian networks: approaches and issues (2011, methodology): “Other researchers have designed methods to try to alleviate the problems of conditioning; for more information see, for example, Dı́ez (1996), Shachter et al. (1994) and Darwiche (1995, 2001b).”