On the use of stochastic local search techniques to revise first-order logic theories from examples

DOI10.1007/S10994-016-5595-3MaRDI QIDQ2361575zbMATH OpenOpenAlexFDO

Authors Aline Paes, Gerson Zaverucha, Vítor Costa

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

zbMATH Keywords

inductive logic programmingstochastic local searchtheory revision from examples

Mathematics Subject Classification ID

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

Recommendations

• Revising First-Order Logic Theories from Examples Through Stochastic Local Search
• Inductive Logic Programming
• Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples
• Using the bottom clause and mode declarations in FOL theory revision from examples
• scientific article; zbMATH DE number 1149434

Cites work

• Advances in Artificial Intelligence – SBIA 2004
• An investigation into feature construction to assist word sense disambiguation
• Concept formation during interactive theory revision
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 1950788 (Why is no real title available?)
• scientific article; zbMATH DE number 1759249 (Why is no real title available?)
• scientific article; zbMATH DE number 1759256 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 956863 (Why is no real title available?)
• ILP Through Propositionalization and Stochastic k-Term DNF Learning
• Improving inductive logic programming by using simulated annealing
• Inductive Logic Programming
• Knowledge discovery from data streams.
• Knowledge-based artificial neural networks
• Linear resolution with selection function
• Markov logic networks
• Multistrategy theory revision: Induction and abduction in INTHELEX
• ProGolem: a system based on relative minimal generalisation
• QG/GA: a stochastic search for Progol
• Randomised restarted search in ILP
• Revising First-Order Logic Theories from Examples Through Stochastic Local Search
• Stochastic local search. Foundations and applications.
• Structured machine learning: the next ten years
• The YAP prolog system
• Top-down induction of first-order logical decision trees
• Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples

Cited in

(8)

• Using the bottom clause and mode declarations in FOL theory revision from examples
• Transfer learning by mapping and revising boosted relational dependency networks
• Online probabilistic theory revision from examples with ProPPR
• Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples
• On the formal characterization of the FORTE\_MBC theory revision operators
• Inductive Logic Programming
• Revising First-Order Logic Theories from Examples Through Stochastic Local Search
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

Describes a project that uses

Uses Software

• YAP-Prolog
• Aleph
• ProGolem
• Walksat
• DIMACS

This page was built for publication: On the use of stochastic local search techniques to revise first-order logic theories from examples

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