scientific article; zbMATH DE number 1946853
From MaRDI portal
Publication:4411139
zbMath1045.68131MaRDI QIDQ4411139
Pierre Marquis, Adnan Darwiche
Publication date: 7 July 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations ⋮ A Study of Symmetry Breaking Predicates and Model Counting ⋮ Learning Probabilistic Logic Programs over Continuous Data ⋮ No Efficient Disjunction or Conjunction of Switch-Lists ⋮ On the Tractability of SHAP Explanations ⋮ Expressive Power and Succinctness of the Positive Calculus of Relations ⋮ A resolution proof system for dependency stochastic Boolean satisfiability ⋮ Combining incomplete search and clause generation: an application to the orienteering problems with time windows ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ Tractability of explaining classifier decisions ⋮ Partially unate Boolean functions: properties of their sum-of-products representations ⋮ On computing probabilistic abductive explanations ⋮ On the (complete) reasons behind decisions ⋮ On incompleteness in abstract argumentation: complexity and expressiveness ⋮ New bounds for the Moser‐Tardos distribution ⋮ Properties of Switch-List Representations of Boolean Functions ⋮ MAP Inference for Probabilistic Logic Programming ⋮ Bounds on the size of PC and URC formulas ⋮ Unnamed Item ⋮ Discrete-Event Systems Fault Diagnosis ⋮ Knowledge Compilation with Empowerment ⋮ Lifted generative learning of Markov logic networks ⋮ Model checking finite-horizon Markov chains with probabilistic inference ⋮ Compacting Boolean Formulae for Inference in Probabilistic Logic Programming ⋮ Expressive power and succinctness of the positive calculus of binary relations ⋮ $$\#\exists $$ SAT: Projected Model Counting ⋮ On Compiling CNFs into Structured Deterministic DNNFs ⋮ SAT-Based Horn Least Upper Bounds ⋮ On the read-once property of branching programs and CNFs of bounded treewidth ⋮ Exploiting local and repeated structure in dynamic Bayesian networks ⋮ Implementing semantic merging operators using binary decision diagrams ⋮ Constrained incomplete argumentation frameworks ⋮ \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Relevant Minimal Change in Belief Update ⋮ Online belief tracking using regression for contingent planning ⋮ Merge-and-Shrink Abstraction ⋮ On probabilistic inference by weighted model counting ⋮ On propositional definability ⋮ Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ Probabilistic argumentation ⋮ Reasoning under minimal upper bounds in propositional logic ⋮ On Compiling Structured CNFs to OBDDs ⋮ Handling epistemic and aleatory uncertainties in probabilistic circuits ⋮ Knowledge compilation meets database theory: compiling queries to decision diagrams ⋮ Learning a propagation complete formula ⋮ Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form ⋮ Algebraic model counting ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ On compiling structured CNFs to OBDDs ⋮ Oblivious bounds on the probability of boolean functions ⋮ Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints ⋮ The complexity of AND-decomposition of Boolean functions ⋮ Causal inference in cplint ⋮ COORDINATION DIAGNOSTIC ALGORITHMS FOR TEAMS OF SITUATED AGENTS: SCALING UP ⋮ Inference and learning in probabilistic logic programs using weighted Boolean formulas ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Bandit-based Monte-Carlo structure learning of probabilistic logic programs ⋮ Prime forms and minimal change in propositional belief bases ⋮ Lifted discriminative learning of probabilistic logic programs ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ A generic approach to planning in the presence of incomplete information: theory and implementation ⋮ kProbLog: an algebraic Prolog for machine learning ⋮ Representing abstract dialectical frameworks with binary decision diagrams ⋮ IASCAR: incremental answer set counting by anytime refinement ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Semiring programming: a semantic framework for generalized sum product problems ⋮ Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory ⋮ Logical Compilation of Bayesian Networks with Discrete Variables ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Reasoning about actions with loops via Hoare logic ⋮ Disjunctive closures for knowledge compilation ⋮ Algorithms for computing minimal equivalent subformulas ⋮ Generating custom propagators for arbitrary constraints ⋮ A generic framework for a compilation-based inference in probabilistic and possibilistic networks ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ Neural probabilistic logic programming in DeepProbLog ⋮ Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach ⋮ Recognition of tractable DNFs representable by a constant number of intervals ⋮ A subclass of Horn CNFs optimally compressible in polynomial time ⋮ Using probabilistic argumentation for key validation in public-key cryptography ⋮ SampleSearch: importance sampling in presence of determinism ⋮ State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning ⋮ The weighted grammar constraint ⋮ A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy ⋮ Annotation theories over finite graphs ⋮ Compiling relational Bayesian networks for exact inference ⋮ A Unified Framework for Certificate and Compilation for QBF ⋮ Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations ⋮ A new default theories compilation for MSP-entailment ⋮ On the relation between structured \(d\)-DNNFs and SDDs ⋮ Probabilistic sentence satisfiability: an approach to PSAT ⋮ Inlining External Sources in Answer Set Programs ⋮ Possibilistic Local Structure for Compiling Min-Based Networks ⋮ Learning to assign degrees of belief in relational domains ⋮ Knowledge-based programs as succinct policies for partially observable domains ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems ⋮ Definability for model counting ⋮ Parameterized Compilation Lower Bounds for Restricted CNF-Formulas ⋮ Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
This page was built for publication:
