Decomposable negation normal form

DOI10.1145/502090.502091zbMath1127.03321OpenAlexW1986660301MaRDI QIDQ5441353

Adnan Darwiche

Publication date: 11 February 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/502090.502091

Mathematics Subject Classification ID

Related Items (43)

Characterizing Tseitin-Formulas with Short Regular Resolution Refutations ⋮ On preprocessing techniques and their impact on propositional model counting ⋮ Memory-limited model-based diagnosis ⋮ $$\#\exists $$ SAT: Projected Model Counting ⋮ On Compiling CNFs into Structured Deterministic DNNFs ⋮ On the read-once property of branching programs and CNFs of bounded treewidth ⋮ On propositional definability ⋮ Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ Some computational aspects of DISTANCE SAT ⋮ How many diagnoses do we need? ⋮ Efficient query processing with reduced implicate tries ⋮ Weighted positive binary decision diagrams for exact probabilistic inference ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ A first polynomial non-clausal class in many-valued logic ⋮ On computing probabilistic abductive explanations ⋮ On the (complete) reasons behind decisions ⋮ Boolean functional synthesis: from under the hood of solvers ⋮ Logical Compilation of Bayesian Networks with Discrete Variables ⋮ Disjunctive closures for knowledge compilation ⋮ Quantifier elimination by dependency sequents ⋮ First order LUB approximations: characterization and algorithms ⋮ A generic framework for a compilation-based inference in probabilistic and possibilistic networks ⋮ Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach ⋮ A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy ⋮ Recursive conditioning ⋮ Unnamed Item ⋮ A new default theories compilation for MSP-entailment ⋮ On the relation between structured \(d\)-DNNFs and SDDs ⋮ Possibilistic Local Structure for Compiling Min-Based Networks ⋮ Boolean functional synthesis: hardness and practical algorithms ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems ⋮ Definability for model counting ⋮ Parameterized Compilation Lower Bounds for Restricted CNF-Formulas ⋮ Model-Based Diagnosis with Probabilistic Models ⋮ On the relative succinctness of sentential decision diagrams ⋮ On limitations of structured (deterministic) DNNFs ⋮ Connecting knowledge compilation classes and width parameters ⋮ The possibilistic Horn non-clausal knowledge bases ⋮ Implementing Efficient All Solutions SAT Solvers ⋮ Inference using compiled min-based possibilistic causal networks in the presence of interventions ⋮ On Quantifying Literals in Boolean Logic and its Applications to Explainable AI ⋮ Compiling propositional weighted bases ⋮ Characterizing Tseitin-formulas with short regular resolution refutations

This page was built for publication: Decomposable negation normal form