The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause

DOI10.1007/s10994-009-5117-7zbMath1470.68186OpenAlexW1966961673MaRDI QIDQ1959491

Alireza Tamaddoni-Nezhad, Stephen H. Muggleton

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-5117-7

zbMATH Keywords

inductive logic programmingordered clausesrefinement operatorssequential subsumptionsubsumption latticesubsumption relative to a bottom clause

Mathematics Subject Classification ID

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

Related Items (2)

Learning from interpretation transition using differentiable logic programming semantics ⋮ Inverse subsumption for complete explanatory induction

Uses Software

• SeqLog
• Aleph
• GOLEM

Cites Work

• Foundations of inductive logic programming
• Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples
• A Note on Refinement Operators for IE-Based ILP Systems
• ProGolem: A System Based on Relative Minimal Generalisation
• On Generalization and Subsumption for Ordered Clauses
• Database Support for Data Mining Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause