Bandit-based Monte-Carlo structure learning of probabilistic logic programs

DOI10.1007/S10994-015-5510-3MaRDI QIDQ894703zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Nicola Di Mauro, Elena Bellodi, Fabrizio Riguzzi

Publication date 2 December 2015

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-015-5510-3

zbMATH Keywords

structure learningMonte Carlo tree searchstatistical relational learningmulti-armed bandit problemdistribution semanticslogic programs with annotated disjunctions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17) Markov and semi-Markov decision processes (90C40)

Recommendations

• Lifted discriminative learning of probabilistic logic programs
• Learning probabilistic logic programs over continuous data
• Structure learning of probabilistic logic programs by searching the clause space
• Algorithmic Learning Theory
• On the implementation of the probabilistic logic programming language ProbLog

Cites work

• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 1946864 (Why is no real title available?)
• scientific article; zbMATH DE number 1950788 (Why is no real title available?)
• scientific article; zbMATH DE number 1753155 (Why is no real title available?)
• A simplified method for lateral response analysis of suspension bridges under wind loads
• ALLPAD: approximate learning of logic programs with annotated disjunctions
• Applying the information bottleneck to statistical relational learning
• Basic Principles of Learning Bayesian Logic Programs
• Compressing probabilistic Prolog programs
• Estimating the dimension of a model
• Extended semantics and inference for the Independent Choice Logic
• FactorBase
• Finite-time analysis of the multiarmed bandit problem
• Foundations of inductive logic programming
• Gradient-based boosting for statistical relational learning: the relational dependency network case
• Improving the variable ordering of OBDDs is NP-complete
• Inductive Logic Programming
• Inductive Logic Programming
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Learning ground GP-logic theories by leveraging Bayesian network learnng techniques
• Logic Programming
• Playing Billiards in Version Space
• Randomised restarted search in ILP
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• Revising First-Order Logic Theories from Examples Through Stochastic Local Search
• Some aspects of the sequential design of experiments
• Structure learning of probabilistic logic programs by searching the clause space
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
• The Independent Choice Logic and Beyond
• The PITA system: tabling and answer subsumption for reasoning under uncertainty
• The YAP prolog system
• Using the bottom clause and mode declarations in FOL theory revision from examples
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics

Cited in

(4)

• Probabilistic inductive constraint logic
• Using SWISH to realize interactive web-based tutorials for logic-based languages
• Structure learning of probabilistic logic programs by searching the clause space
• Lifted discriminative learning of probabilistic logic programs

Describes a project that uses

Uses Software

• MapReduce
• ProbLog
• YAP-Prolog
• PITA
• FactorBase

This page was built for publication: Bandit-based Monte-Carlo structure learning of probabilistic logic programs

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