Decomposable negation normal form
From MaRDI portal
Recommendations
- Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation
- Normal Forms for Knowledge Compilation
- On compiling CNFs into structured deterministic DNNFs
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- scientific article; zbMATH DE number 1946853
Cited in
(70)- Recursive conditioning
- Boolean functional synthesis: hardness and practical algorithms
- On the relative succinctness of sentential decision diagrams
- Characterizing Tseitin-formulas with short regular resolution refutations
- The possibilistic Horn non-clausal knowledge bases
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- On computing probabilistic abductive explanations
- The ghosts of forgotten things: a study on size after forgetting
- Implementing efficient All solutions SAT solvers
- Disjunctive closures for knowledge compilation
- On preprocessing techniques and their impact on propositional model counting
- On propositional definability
- How many diagnoses do we need?
- Memory-limited model-based diagnosis
- Possibilistic local structure for compiling min-based networks
- A new default theories compilation for MSP-entailment
- Parameterized compilation lower bounds for restricted CNF-formulas
- Top-down algorithms for constructing structured DNNF: theoretical and practical implications
- Fixed parameter tractable optimization under DNNF constraints
- New canonical representations by augmenting OBDDs with conjunctive decomposition
- Normal Forms for Knowledge Compilation
- On the read-once property of branching programs and CNFs of bounded treewidth
- Efficient query processing with reduced implicate tries
- Some computational aspects of DISTANCE SAT
- First order LUB approximations: characterization and algorithms
- Negation-Limited Formulas.
- Logical Compilation of Bayesian Networks with Discrete Variables
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy
- Inference using compiled min-based possibilistic causal networks in the presence of interventions
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Feature necessity and relevancy in machine learning explanations
- On the role of modeling causal independence for system model compilation with OBDDs
- scientific article; zbMATH DE number 7559127 (Why is no real title available?)
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
- Quantifier elimination by dependency sequents
- Knowledge compilation. Preface.
- On the benefits of knowledge compilation for feature-model analyses
- Tractable representations for Boolean functional synthesis
- Approximating queries on probabilistic graphs
- Definability for model counting
- Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation
- Duality in Knowledge Compilation Techniques
- Weighted positive binary decision diagrams for exact probabilistic inference
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
- Entailment vs. verification for partial-assignment satisfiability and enumeration
- The splitting power of branching programs of bounded repetition and CNFs of bounded width
- Connecting knowledge compilation classes and width parameters
- On limitations of structured (deterministic) DNNFs
- scientific article; zbMATH DE number 1696816 (Why is no real title available?)
- Symmetry-driven decision diagrams for knowledge compilation
- On the role of logical separability in knowledge compilation
- An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL
- A generic framework for a compilation-based inference in probabilistic and possibilistic networks
- Compiling min-based possibilistic causal networks: a mutilated-based approach
- Conjunctive queries on probabilistic graphs: the limits of approximability
- Circuits, proofs and propositional model counting
- A characterization of efficiently compilable constraint languages
- Model-based diagnosis with probabilistic models
- Boolean functional synthesis: from under the hood of solvers
- A first polynomial non-clausal class in many-valued logic
- Sufficient and necessary conditions for solution finding in valuation-based systems
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- On the (complete) reasons behind decisions
- Counterexample guided knowledge compilation for Boolean functional synthesis
- On compiling CNFs into structured deterministic DNNFs
- Complexity issues related to propagation completeness
- Compiling propositional weighted bases
- On the relation between structured \(d\)-DNNFs and SDDs
- The language of search
- On quantifying literals in Boolean logic and its applications to explainable AI
This page was built for publication: Decomposable negation normal form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5441353)
