Inference and learning in probabilistic logic programs using weighted Boolean formulas

DOI10.1017/S1471068414000076zbMath1379.68062arXiv1304.6810MaRDI QIDQ4592983

Dimitar Shterionov, Joris Renkens, Ingo Thon, Bernd Gutmann, Gerda Janssens, Daan Fierens, Guy Van den Broeck, Luc De Raedt

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.6810

zbMATH Keywords

probabilistic inferenceparameter learningprobabilistic logic programming

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Related Items (51)

Efficient Knowledge Compilation Beyond Weighted Model Counting ⋮ Symbolic DNN-tuner ⋮ Model checking finite-horizon Markov chains with probabilistic inference ⋮ Compacting Boolean Formulae for Inference in Probabilistic Logic Programming ⋮ A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics ⋮ Exploiting local and repeated structure in dynamic Bayesian networks ⋮ Diffusion centrality: a paradigm to maximize spread in social networks ⋮ \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Probabilistic abductive logic programming using Dirichlet priors ⋮ A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ Explanations as programs in probabilistic logic programming ⋮ Handling epistemic and aleatory uncertainties in probabilistic circuits ⋮ Exact stochastic constraint optimisation with applications in network analysis ⋮ Connecting Width and Structure in Knowledge Compilation (Extended Version) ⋮ Computing LP^MLN using ASP and MLN solvers ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ Probabilistic (logic) programming concepts ⋮ Bandit-based Monte-Carlo structure learning of probabilistic logic programs ⋮ Lifted inference with tree axioms ⋮ Disjunctive delimited control ⋮ Statistical relational extension of answer set programming ⋮ Unified decomposition-aggregation (UDA) rules: dynamic, schematic, novel axioms ⋮ Rule Induction and Reasoning over Knowledge Graphs ⋮ Online event recognition over noisy data streams ⋮ IASCAR: incremental answer set counting by anytime refinement ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Lifted Bayesian Filtering in Multiset Rewriting Systems ⋮ MAP Inference for Probabilistic Logic Programming ⋮ Some thoughts on knowledge-enhanced machine learning ⋮ Neural probabilistic logic programming in DeepProbLog ⋮ On the complexity of propositional and relational credal networks ⋮ Speeding up parameter and rule learning for acyclic probabilistic logic programs ⋮ Using SWISH to Realize Interactive Web-based Tutorials for Logic-based Languages ⋮ The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws ⋮ Probabilistic sentence satisfiability: an approach to PSAT ⋮ Probabilistic abstract argumentation frameworks, a possible world view ⋮ Complexity results for probabilistic answer set programming ⋮ Predictive spreadsheet autocompletion with constraints ⋮ Confidences for commonsense reasoning ⋮ P-log: refinement and a new coherency condition ⋮ Learning hierarchical probabilistic logic programs ⋮ Advanced SMT techniques for weighted model integration ⋮ Connecting knowledge compilation classes and width parameters ⋮ Approximate weighted model integration on DNF structures ⋮ A taxonomy of weight learning methods for statistical relational learning ⋮ Optimizing Probabilities in Probabilistic Logic Programs ⋮ Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs ⋮ Weighted model counting without parameter variables

Uses Software

• ASSAT
• ProbLog
• CP-logic
• Dsharp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic inductive logic programming. Theory and applications
• Compiling relational Bayesian networks for exact inference
• Dedicated tabling for a probabilistic setting
• On the implementation of the probabilistic logic programming language ProbLog
• CP-logic: A language of causal probabilistic events and its relation to logic programming
• Logical and Relational Learning
• CP-Logic Theory Inference with Contextual Variable Elimination and Comparison to BDD Based Inference Methods
• Modeling and Reasoning with Bayesian Networks
• Graph-Based Algorithms for Boolean Function Manipulation
• Graph minors. II. Algorithmic aspects of tree-width
• The well-founded semantics for general logic programs
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
• Logic programming revisited

This page was built for publication: Inference and learning in probabilistic logic programs using weighted Boolean formulas