The following pages link to (Q4411139):
Displaying 50 items.
- Lifted generative learning of Markov logic networks (Q285935) (← links)
- On the read-once property of branching programs and CNFs of bounded treewidth (Q309788) (← links)
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs (Q324656) (← links)
- Online belief tracking using regression for contingent planning (Q334802) (← links)
- Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- A generic framework for a compilation-based inference in probabilistic and possibilistic networks (Q498039) (← links)
- SampleSearch: importance sampling in presence of determinism (Q543621) (← links)
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (Q543630) (← links)
- The weighted grammar constraint (Q545550) (← links)
- Prime forms and minimal change in propositional belief bases (Q622590) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- On stratified belief base compilation (Q702098) (← links)
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- Connecting knowledge compilation classes and width parameters (Q778533) (← links)
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement (Q785225) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- Model checking finite-horizon Markov chains with probabilistic inference (Q832295) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- Efficient query processing with reduced implicate tries (Q877893) (← links)
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs (Q894703) (← links)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
- A generic approach to planning in the presence of incomplete information: theory and implementation (Q899156) (← links)
- A new default theories compilation for MSP-entailment (Q989883) (← links)
- Learning to assign degrees of belief in relational domains (Q1009279) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← links)
- Representing interval orders by weighted bases: some complexity results (Q1042324) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints (Q1678427) (← links)
- Causal inference in cplint (Q1679666) (← links)
- kProbLog: an algebraic Prolog for machine learning (Q1699913) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Reasoning about actions with loops via Hoare logic (Q1712544) (← links)
- Recognition of tractable DNFs representable by a constant number of intervals (Q1751204) (← links)
- Using probabilistic argumentation for key validation in public-key cryptography (Q1763172) (← links)
- Knowledge compilation using the extension rule (Q1876096) (← links)
- CoLab: A hybrid knowledge representation and compilation laboratory (Q1897397) (← 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)
- Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← links)
- A compositional approach to probabilistic knowledge compilation (Q2060758) (← links)
- Abduction with probabilistic logic programming under the distribution semantics (Q2076968) (← links)
- Propagation complete encodings of smooth DNNF theories (Q2079276) (← links)
- MDDs boost equation solving on discrete dynamical systems (Q2117218) (← links)
- Davis and Putnam meet Henkin: solving DQBF with resolution (Q2118283) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Expressive power and succinctness of the positive calculus of binary relations (Q2141281) (← links)
