Completeness and properness of refinement operators in inductive logic programming

DOI10.1016/S0743-1066(97)00077-0MaRDI QIDQ4208851zbMATH OpenOpenAlexFDO

Authors Patrick Ronald Jaap van der Laag, Shan-Hwei Nienhuys-Cheng

Publication date 24 November 1998

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(97)00077-0

zbMATH Keywords

inductive logic programmingrefinement operator

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1015105
• A Note on Refinement Operators for IE-Based ILP Systems
• scientific article; zbMATH DE number 1322797
• scientific article; zbMATH DE number 1696699
• Foundations of Refinement Operators for Description Logics

Cited in

(11)

• Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\)
• Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention
• scientific article; zbMATH DE number 1696699 (Why is no real title available?)
• A generalization model based on OI-implication for ideal theory refinement
• A Note on Refinement Operators for IE-Based ILP Systems
• scientific article; zbMATH DE number 1223543 (Why is no real title available?)
• scientific article; zbMATH DE number 1322797 (Why is no real title available?)
• scientific article; zbMATH DE number 1015105 (Why is no real title available?)
• scientific article; zbMATH DE number 1877042 (Why is no real title available?)
• A refinement operator for inducing threaded-variable clauses
• Analogical logic program synthesis algorithm that can refute inappropriate similarities

This page was built for publication: Completeness and properness of refinement operators in inductive logic programming

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