The following pages link to Decomposable negation normal form (Q5441353):
Displayed 43 items.
- On the read-once property of branching programs and CNFs of bounded treewidth (Q309788) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Quantifier elimination by dependency sequents (Q479823) (← links)
- A generic framework for a compilation-based inference in probabilistic and possibilistic networks (Q498039) (← links)
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- Connecting knowledge compilation classes and width parameters (Q778533) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Efficient query processing with reduced implicate tries (Q877893) (← links)
- A new default theories compilation for MSP-entailment (Q989883) (← links)
- Weighted positive binary decision diagrams for exact probabilistic inference (Q1678452) (← links)
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643) (← links)
- On the relation between structured \(d\)-DNNFs and SDDs (Q2035477) (← links)
- Boolean functional synthesis: hardness and practical algorithms (Q2050108) (← links)
- The possibilistic Horn non-clausal knowledge bases (Q2105624) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Memory-limited model-based diagnosis (Q2124447) (← links)
- Sufficient and necessary conditions for solution finding in valuation-based systems (Q2302788) (← links)
- Definability for model counting (Q2303508) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- Inference using compiled min-based possibilistic causal networks in the presence of interventions (Q2351610) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- On propositional definability (Q2389643) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- How many diagnoses do we need? (Q2407458) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- Possibilistic Local Structure for Compiling Min-Based Networks (Q2805818) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach (Q3011984) (← links)
- $$\#\exists $$ SAT: Projected Model Counting (Q3453218) (← links)
- On Compiling CNFs into Structured Deterministic DNNFs (Q3453225) (← links)
- Logical Compilation of Bayesian Networks with Discrete Variables (Q3524963) (← links)
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
- (Q5090465) (← links)
- Model-Based Diagnosis with Probabilistic Models (Q5237332) (← links)
- Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)
- Recursive conditioning (Q5940818) (← links)
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth (Q6080986) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)
- On computing probabilistic abductive explanations (Q6116531) (← links)
- On the (complete) reasons behind decisions (Q6117140) (← links)
- Boolean functional synthesis: from under the hood of solvers (Q6132564) (← links)