Bandit-based Monte-Carlo structure learning of probabilistic logic programs
type: Item
instance of: scholarly article
title: Bandit-based Monte-Carlo structure learning of probabilistic logic programs
zbMATH Open document ID: 1346.68051
author: Nicola Di Mauro
author: Elena Bellodi
author: Fabrizio Riguzzi
published in: Machine Learning
publication date: 2015-12-02T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 6515564
zbMATH Keywords: statistical relational learning
zbMATH Keywords: structure learning
zbMATH Keywords: distribution semantics
zbMATH Keywords: multi-armed bandit problem
zbMATH Keywords: Monte Carlo tree search
zbMATH Keywords: logic programs with annotated disjunctions
cites work: FactorBase
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: Structure learning of probabilistic logic programs by searching the clause space
cites work: Improving the variable ordering of OBDDs is NP-complete
cites work: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
cites work: Q4411139
cites work: Extended semantics and inference for the Independent Choice Logic
cites work: Compressing probabilistic Prolog programs
cites work: Using the bottom clause and mode declarations in FOL theory revision from examples
cites work: A simplified method for lateral response analysis of suspension bridges under wind loads
cites work: Inference and learning in probabilistic logic programs using weighted Boolean formulas
cites work: Estimating the dimension of a model
cites work: Q4411151
cites work: Basic Principles of Learning Bayesian Logic Programs
cites work: Q3602746
cites work: Gradient-based boosting for statistical relational learning: the relational dependency network case
cites work: Foundations of inductive logic programming
cites work: Inductive Logic Programming
cites work: Revising First-Order Logic Theories from Examples Through Stochastic Local Search
cites work: The Independent Choice Logic and Beyond
cites work: ALLPAD: approximate learning of logic programs with annotated disjunctions
cites work: Applying the information bottleneck to statistical relational learning
cites work: Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
cites work: The PITA system: Tabling and answer subsumption for reasoning under uncertainty
cites work: Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
cites work: Some aspects of the sequential design of experiments
cites work: Playing Billiards in Version Space
cites work: The YAP prolog system
cites work: Q4533365
cites work: Logic Programming
cites work: Q4413504
cites work: Randomised restarted search in ILP
describes a project that uses: FactorBase
describes a project that uses: MapReduce
describes a project that uses: ProbLog
describes a project that uses: YAP-Prolog
describes a project that uses: PITA
MaRDI profile type: Publication
full work available at URL: s10994-015-5510-3
OpenAlex ID: W1200217156
Wikidata QID: Q58063645
DOI: 10.1007/S10994-015-5510-3
DBLP publication ID: journals/ml/MauroBR15
description: scientific article; zbMATH DE number 6515564