Completeness and properness of refinement operators in inductive logic programming

DOI10.1016/S0743-1066(97)00077-0zbMath0905.68027OpenAlexW2076054154MaRDI QIDQ4208851

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)

Related Items (3)

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