Bandit-based Monte-Carlo structure learning of probabilistic logic programs
From MaRDI portal
Publication:894703
DOI10.1007/s10994-015-5510-3zbMath1346.68051WikidataQ58063645 ScholiaQ58063645MaRDI QIDQ894703
Elena Bellodi, Fabrizio Riguzzi, Nicola Di Mauro
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
structure learning; statistical relational learning; Monte Carlo tree search; multi-armed bandit problem; distribution semantics; logic programs with annotated disjunctions
68T05: Learning and adaptive systems in artificial intelligence
90C40: Markov and semi-Markov decision processes
68N17: Logic programming
Related Items
Using SWISH to Realize Interactive Web-based Tutorials for Logic-based Languages, Probabilistic inductive constraint logic, Lifted discriminative learning of probabilistic logic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- FactorBase
- Gradient-based boosting for statistical relational learning: the relational dependency network case
- Applying the information bottleneck to statistical relational learning
- Compressing probabilistic Prolog programs
- ALLPAD: approximate learning of logic programs with annotated disjunctions
- Estimating the dimension of a model
- Foundations of inductive logic programming
- Using the bottom clause and mode declarations in FOL theory revision from examples
- Randomised restarted search in ILP
- Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
- The YAP Prolog system
- The PITA system: Tabling and answer subsumption for reasoning under uncertainty
- Playing Billiards in Version Space
- A simplified method for lateral response analysis of suspension bridges under wind loads
- Extended semantics and inference for the Independent Choice Logic
- Improving the variable ordering of OBDDs is NP-complete
- Structure learning of probabilistic logic programs by searching the clause space
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
- Logic Programming
- Inductive Logic Programming
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Basic Principles of Learning Bayesian Logic Programs
- The Independent Choice Logic and Beyond
- Revising First-Order Logic Theories from Examples Through Stochastic Local Search
- Inductive Logic Programming
- Some aspects of the sequential design of experiments
- Finite-time analysis of the multiarmed bandit problem
