Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples

DOI10.1007/978-3-540-85928-4_11zbMATH Open1156.68526OpenAlexW1492019259MaRDI QIDQ3543271FDOQ3543271

Authors: Ana Luísa Duboc, Aline Paes, Gerson Zaverucha 

Publication date: 2 December 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85928-4_11

Recommendations

• Using the bottom clause and mode declarations in FOL theory revision from examples
• Revising First-Order Logic Theories from Examples Through Stochastic Local Search
• On the use of stochastic local search techniques to revise first-order logic theories from examples
• On the formal characterization of the FORTE\_MBC theory revision operators
• scientific article; zbMATH DE number 1149411

Mathematics Subject Classification ID

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

Cites Work

• Inference for the generalization error
• Title not available (Why is that?)
• Multistrategy theory revision: Induction and abduction in INTHELEX
• Revising First-Order Logic Theories from Examples Through Stochastic Local Search

Cited In (6)

• 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
• The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
• Using the bottom clause and mode declarations in FOL theory revision from examples
• On the formal characterization of the FORTE\_MBC theory revision operators
• Online probabilistic theory revision from examples with ProPPR

This page was built for publication: Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples

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