Revising First-Order Logic Theories from Examples Through Stochastic Local Search

DOI10.1007/978-3-540-78469-2_21zbMATH Open1136.68500OpenAlexW1584655495MaRDI QIDQ5452092FDOQ5452092

Authors: Aline Paes, Gerson Zaverucha, Vítor Costa 

Publication date: 28 March 2008

Published in: Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78469-2_21

Recommendations

• On the use of stochastic local search techniques to revise first-order logic theories from examples
• Inductive Logic Programming
• Using the bottom clause and mode declarations in FOL theory revision from examples
• Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples
• scientific article; zbMATH DE number 1149434

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Randomised restarted search in ILP
• Revising First-Order Logic Theories from Examples Through Stochastic Local Search
• ILP Through Propositionalization and Stochastic k-Term DNF Learning

Cited In (7)

• Inductive Logic Programming
• Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples
• On the use of stochastic local search techniques to revise first-order logic theories from examples
• Revising First-Order Logic Theories from Examples Through Stochastic Local Search
• Bandit-based Monte-Carlo structure learning of probabilistic logic programs
• Using the bottom clause and mode declarations in FOL theory revision from examples
• On the formal characterization of the FORTE\_MBC theory revision operators

Uses Software

• Walksat

This page was built for publication: Revising First-Order Logic Theories from Examples Through Stochastic Local Search

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