The following pages link to (Q4411139):
Displaying 50 items.
- Constrained incomplete argumentation frameworks (Q2146007) (← links)
- Handling epistemic and aleatory uncertainties in probabilistic circuits (Q2163184) (← links)
- Learning a propagation complete formula (Q2170198) (← links)
- The complexity of AND-decomposition of Boolean functions (Q2181249) (← links)
- Semiring programming: a semantic framework for generalized sum product problems (Q2206471) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- Neural probabilistic logic programming in DeepProbLog (Q2238688) (← links)
- Annotation theories over finite graphs (Q2269516) (← links)
- Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations (Q2278099) (← links)
- Probabilistic sentence satisfiability: an approach to PSAT (Q2287193) (← 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)
- Complexity issues related to propagation completeness (Q2351039) (← links)
- Inference using compiled min-based possibilistic causal networks in the presence of interventions (Q2351610) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- Implementing semantic merging operators using binary decision diagrams (Q2379333) (← links)
- On probabilistic inference by weighted model counting (Q2389636) (← links)
- On propositional definability (Q2389643) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- Probabilistic argumentation (Q2390652) (← links)
- Algebraic model counting (Q2407478) (← links)
- On compiling structured CNFs to OBDDs (Q2411046) (← links)
- Lifted discriminative learning of probabilistic logic programs (Q2425249) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Generating custom propagators for arbitrary constraints (Q2453695) (← links)
- Compiling relational Bayesian networks for exact inference (Q2499043) (← links)
- Exploiting local and repeated structure in dynamic Bayesian networks (Q2634474) (← links)
- Representing abstract dialectical frameworks with binary decision diagrams (Q2694565) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q2694570) (← links)
- Possibilistic Local Structure for Compiling Min-Based Networks (Q2805818) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers (Q2818024) (← links)
- Action failure recovery via model-based diagnosis and conformant planning (Q2857292) (← links)
- Knowledge Compilation with Empowerment (Q2891394) (← links)
- Relevant Minimal Change in Belief Update (Q2915083) (← links)
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form (Q2938491) (← links)
- Oblivious bounds on the probability of boolean functions (Q2943565) (← links)
- New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition (Q2974513) (← links)
- Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach (Q3011984) (← links)
- Merge-and-Shrink Abstraction (Q3189651) (← links)
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
- COORDINATION DIAGNOSTIC ALGORITHMS FOR TEAMS OF SITUATED AGENTS: SCALING UP (Q3224881) (← links)
- Compacting Boolean Formulae for Inference in Probabilistic Logic Programming (Q3449226) (← links)
- $$\#\exists $$ SAT: Projected Model Counting (Q3453218) (← links)
- On Compiling CNFs into Structured Deterministic DNNFs (Q3453225) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory (Q3524940) (← links)
- Logical Compilation of Bayesian Networks with Discrete Variables (Q3524963) (← links)
- A Unified Framework for Certificate and Compilation for QBF (Q3601811) (← links)
