Structure learning of probabilistic logic programs by searching the clause space

DOI10.1017/S1471068413000689zbMATH Open1379.68269DBLPjournals/tplp/BellodiR15arXiv1309.2080OpenAlexW3101127636WikidataQ58063664 ScholiaQ58063664MaRDI QIDQ4592977FDOQ4592977

Fabrizio Riguzzi, Elena Bellodi

Publication date: 9 November 2017

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

Abstract: Learning probabilistic logic programming languages is receiving an increasing attention and systems are available for learning the parameters (PRISM, LeProbLog, LFI-ProbLog and EMBLEM) or both the structure and the parameters (SEM-CP-logic and SLIPCASE) of these languages. In this paper we present the algorithm SLIPCOVER for "Structure LearnIng of Probabilistic logic programs by searChing OVER the clause space". It performs a beam search in the space of probabilistic clauses and a greedy search in the space of theories, using the log likelihood of the data as the guiding heuristics. To estimate the log likelihood SLIPCOVER performs Expectation Maximization with EMBLEM. The algorithm has been tested on five real world datasets and compared with SLIPCASE, SEM-CP-logic, Aleph and two algorithms for learning Markov Logic Networks (Learning using Structural Motifs (LSM) and ALEPH++ExactL1). SLIPCOVER achieves higher areas under the precision-recall and ROC curves in most cases.

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

Recommendations

• scientific article; zbMATH DE number 1950779
• Lifted discriminative learning of probabilistic logic programs
• Bandit-based Monte-Carlo structure learning of probabilistic logic programs
• Closed-form solutions in learning probabilistic logic programs by exact score maximization
• Parameter estimation in stochastic logic programs

zbMATH Keywords

structure learningstatistical relational learningCP-logicdistribution semanticsprobabilistic inductive logic programminglogic programs with annotated disjunction

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Cites Work

• The YAP prolog system
• The PITA system: Tabling and answer subsumption for reasoning under uncertainty
• CP-logic: A language of causal probabilistic events and its relation to logic programming
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
• Estimating the dimension of a model
• The well-founded semantics for general logic programs
• Probabilistic inductive logic programming. Theory and applications
• Markov logic networks
• The independent choice logic for modelling multiple agents under uncertainty
• On the implementation of the probabilistic logic programming language ProbLog
• Title not available (Why is that?)
• Logic Programming
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• ALLPAD: approximate learning of logic programs with annotated disjunctions
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
• Title not available (Why is that?)
• Learning ground GP-logic theories by leveraging Bayesian network learnng techniques
• Applying the information bottleneck to statistical relational learning
• Inductive Logic Programming
• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
• Relational learning with statistical predicate invention: Better models for hypertext
• Extended semantics and inference for the Independent Choice Logic
• Theory refinement combining analytical and empirical methods
• Compressing probabilistic Prolog programs
• Approximate Inference for Logic Programs with Annotated Disjunctions
• Discriminative Structure Learning of Markov Logic Networks
• Probabilistic Rule Learning
• Logic Programming
• Title not available (Why is that?)

Cited In (21)

• DKL: an efficient algorithm for learning deterministic Kripke structures
• Inductive logic programming at 30
• Optimizing Probabilities in Probabilistic Logic Programs
• Speeding up parameter and rule learning for acyclic probabilistic logic programs
• Learning to rank the distinctiveness of behaviour in serial offending
• \(\alpha\)ILP: thinking visual scenes as differentiable logic programs
• Title not available (Why is that?)
• Learning Effect Axioms via Probabilistic Logic Programming
• Learning Probabilistic Logic Programs over Continuous Data
• The complexity and generality of learning answer set programs
• Tableau reasoning for description logics and its extension to probabilities
• Bandit-based Monte-Carlo structure learning of probabilistic logic programs
• Probabilistic inductive constraint logic
• Inductive general game playing
• Lifted discriminative learning of probabilistic logic programs
• Using SWISH to Realize Interactive Web-based Tutorials for Logic-based Languages
• Learning hierarchical probabilistic logic programs
• Abduction with probabilistic logic programming under the distribution semantics
• Theory and Applications of Satisfiability Testing
• CHR(PRISM)-based probabilistic logic learning
• Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases

Uses Software

• ProbLog
• CP-logic
• YAP-Prolog
• PITA
• MCINTYRE
• FOIL

This page was built for publication: Structure learning of probabilistic logic programs by searching the clause space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592977)