Inference and learning in probabilistic logic programs using weighted Boolean formulas
From MaRDI portal
Abstract: Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. This paper investigates how classical inference and learning tasks known from the graphical model community can be tackled for probabilistic logic programs. Several such tasks such as computing the marginals given evidence and learning from (partial) interpretations have not really been addressed for probabilistic logic programs before. The first contribution of this paper is a suite of efficient algorithms for various inference tasks. It is based on a conversion of the program and the queries and evidence to a weighted Boolean formula. This allows us to reduce the inference tasks to well-studied tasks such as weighted model counting, which can be solved using state-of-the-art methods known from the graphical model and knowledge compilation literature. The second contribution is an algorithm for parameter estimation in the learning from interpretations setting. The algorithm employs Expectation Maximization, and is built on top of the developed inference algorithms. The proposed approach is experimentally evaluated. The results show that the inference algorithms improve upon the state-of-the-art in probabilistic logic programming and that it is indeed possible to learn the parameters of a probabilistic logic program from interpretations.
Recommendations
- MAP inference for probabilistic logic programming
- Approximate Inference for Logic Programs with Annotated Disjunctions
- Compacting Boolean formulae for inference in probabilistic logic programming
- Constraint-based inference in probabilistic logic programs
- Lifted discriminative learning of probabilistic logic programs
Cites work
- Compiling relational Bayesian networks for exact inference
- CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Dedicated tabling for a probabilistic setting
- Graph minors. II. Algorithmic aspects of tree-width
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 408795 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- Logic programming revisited: logic programs as inductive definitions
- Logical and Relational Learning
- Modeling and Reasoning with Bayesian Networks
- On the implementation of the probabilistic logic programming language ProbLog
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Probabilistic inductive logic programming. Theory and applications
- The well-founded semantics for general logic programs
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
Cited in
(77)- Weighted positive binary decision diagrams for exact probabilistic inference
- The complexity of Bayesian networks specified by propositional and relational languages
- Learning to rank in PRISM
- Speeding up parameter and rule learning for acyclic probabilistic logic programs
- Confidences for commonsense reasoning
- Learning hierarchical probabilistic logic programs
- Approximate weighted model integration on DNF structures
- A taxonomy of weight learning methods for statistical relational learning
- Weighted model counting without parameter variables
- Symbolic DNN-tuner
- 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
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Thirty years of credal networks: specification, algorithms and complexity
- Some thoughts on knowledge-enhanced machine learning
- Neural probabilistic logic programming in DeepProbLog
- 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
- P-log: refinement and a new coherency condition
- Advanced SMT techniques for weighted model integration
- A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics
- Exploiting local and repeated structure in dynamic Bayesian networks
- Exact stochastic constraint optimisation with applications in network analysis
- IASCAR: incremental answer set counting by anytime refinement
- Products of weighted logic programs
- 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
- Connecting width and structure in knowledge compilation
- Compacting Boolean formulae for inference in probabilistic logic programming
- scientific article; zbMATH DE number 1950779 (Why is no real title available?)
- Constraint-based inference in probabilistic logic programs
- Interpretable encoding of densities using possibilistic logic
- Computing \(\mathrm{LP}^{\mathrm{MLN}}\) using ASP and MLN solvers
- Knowledge compilation of logic programs using approximation fixpoint theory
- Optimizing probabilities in probabilistic logic programs
- Utilizing treewidth for quantitative reasoning on epistemic logic programs
- Efficient Knowledge Compilation Beyond Weighted Model Counting
- Closed-form solutions in learning probabilistic logic programs by exact score maximization
- Lifted Bayesian filtering in multiset rewriting systems
- MAP inference for probabilistic logic programming
- On the complexity of propositional and relational credal networks
- Using SWISH to realize interactive web-based tutorials for logic-based languages
- Learning effect axioms via probabilistic logic programming
- Dynamic Programming Algorithms as Products of Weighted Logic Programs
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
- 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
- Generative Datalog and answer set programming (extended abstract)
- Generative Datalog with continuous distributions
- Aspmc: new frontiers of algebraic answer set counting
- Semirings for probabilistic and neuro-symbolic logic programming
- Towards an effective practice of learning from data and knowledge
- Languages for probabilistic modeling over structured and relational domains
- IASCAR: incremental answer set counting by anytime refinement
- Declarative probabilistic logic programming in discrete-continuous domains
- How artificial intelligence leads to knowledge why: an inquiry inspired by Aristotle's posterior analytics
- Probability logic and statistical relational artificial intelligence
- Lifted inference beyond first-order logic
- A fast and accurate ASP counting based network reliability estimator
- ``What if? in probabilistic logic programming
- Swift Markov logic for probabilistic reasoning on knowledge graphs
- Learning guided automated reasoning: a brief survey
- Modern Datalog: concepts, methods, applications (invited paper)
- Connecting knowledge compilation classes and width parameters
- Model checking finite-horizon Markov chains with probabilistic inference
- Probabilistic (logic) programming concepts
- Efficient inference and learning in a large knowledge base. Reasoning with extracted information using a locally groundable first-order probabilistic logic
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs
This page was built for publication: Inference and learning in probabilistic logic programs using weighted Boolean formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592983)
