Using the bottom clause and mode declarations in FOL theory revision from examples

DOI10.1007/s10994-009-5116-8zbMath1470.68218OpenAlexW1966334556MaRDI QIDQ1959495

Ana Luísa Duboc, Aline Paes, Gerson Zaverucha

Publication date: 7 October 2010

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-009-5116-8

zbMATH Keywords

ILPtheory revisionmode directed inverse entailment (MDIE)

Mathematics Subject Classification ID

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

Related Items (3)

Bandit-based Monte-Carlo structure learning of probabilistic logic programs ⋮ Transfer learning by mapping and revising boosted relational dependency networks ⋮ Incremental learning of event definitions with inductive logic programming

Uses Software

• Aleph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structured machine learning: the next ten years
• Foundations of inductive logic programming
• Inference for the generalization error
• Logical and Relational Learning
• Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples
• A Note on Refinement Operators for IE-Based ILP Systems
• Inductive Logic Programming: Theory and methods
• Revising First-Order Logic Theories from Examples Through Stochastic Local Search

This page was built for publication: Using the bottom clause and mode declarations in FOL theory revision from examples