Pages that link to "Item:Q4443390"

The following pages link to On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision (Q4443390):

Displaying 30 items.

• An enumerative algorithm for \#2SAT (Q283678) (← links)
• Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
• Connecting knowledge compilation classes and width parameters (Q778533) (← links)
• Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases (Q814499) (← links)
• Compiling propositional weighted bases (Q814606) (← 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)
• Propagation complete encodings of smooth DNNF theories (Q2079276) (← links)
• Weighted model counting without parameter variables (Q2118293) (← links)
• A functional account of probabilistic programming with possible worlds. Declarative pearl (Q2163171) (← links)
• On probabilistic inference by weighted model counting (Q2389636) (← links)
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
• Algebraic model counting (Q2407478) (← links)
• Exact stochastic constraint optimisation with applications in network analysis (Q2667834) (← links)
• (Q3305348) (← links)
• Connecting Width and Structure in Knowledge Compilation (Extended Version) (Q3305349) (← links)
• On Compiling CNFs into Structured Deterministic DNNFs (Q3453225) (← links)
• Local Diagnosis (Q4443394) (← links)
• Inference and learning in probabilistic logic programs using weighted Boolean formulas (Q4592983) (← links)
• The Computational Complexity of Understanding Binary Classifier Decisions (Q5856459) (← links)
• On computing probabilistic abductive explanations (Q6116531) (← links)
• From statistical relational to neurosymbolic artificial intelligence: a survey (Q6494348) (← links)
• On the role of logical separability in knowledge compilation (Q6494362) (← links)
• Counterexample guided knowledge compilation for Boolean functional synthesis (Q6535639) (← links)
• Efficient computation of shap explanation scores for neural network classifiers via knowledge compilation (Q6545518) (← links)
• Knowledge compilation. Preface. (Q6630709) (← links)
• Tractable representations for Boolean functional synthesis (Q6630716) (← links)
• Computational complexity of minimal trap spaces in Boolean networks (Q6633132) (← links)
• IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)
• Declarative probabilistic logic programming in discrete-continuous domains (Q6665698) (← links)