On the use of stochastic local search techniques to revise first-order logic theories from examples
From MaRDI portal
Publication:2361575
DOI10.1007/s10994-016-5595-3zbMath1453.68172OpenAlexW2561609439MaRDI QIDQ2361575
Vitor Costa, Aline Paes, Gerson Zaverucha
Publication date: 30 June 2017
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-016-5595-3
Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Related Items
Online probabilistic theory revision from examples with ProPPR, Transfer learning by mapping and revising boosted relational dependency networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- QG/GA: a stochastic search for Progol
- Structured machine learning: the next ten years
- Top-down induction of first-order logical decision trees
- Concept formation during interactive theory revision
- Knowledge-based artificial neural networks
- Multistrategy theory revision: Induction and abduction in INTHELEX
- An investigation into feature construction to assist word sense disambiguation
- Randomised restarted search in ILP
- Improving inductive logic programming by using simulated annealing
- Markov logic networks
- Linear resolution with selection function
- The YAP Prolog system
- Knowledge Discovery from Data Streams
- Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples
- ProGolem: A System Based on Relative Minimal Generalisation
- Advances in Artificial Intelligence – SBIA 2004
- Inductive Logic Programming
- ILP Through Propositionalization and Stochastic k-Term DNF Learning
- Revising First-Order Logic Theories from Examples Through Stochastic Local Search
