A study of relevance for learning in deductive databases

DOI10.1016/S0743-1066(99)00019-9zbMath0941.68019OpenAlexW2026499370MaRDI QIDQ4262829

Nada Lavrač, Dragan Gamberger, Viktor Jovanoski

Publication date: 22 September 1999

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

Full work available at URL: https://doi.org/10.1016/s0743-1066(99)00019-9

zbMATH Keywords

inductive concept learningLINUS

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Related Items (5)

Block-wise construction of tree-like relational features with monotone reducibility and redundancy ⋮ Finding a short and accurate decision rule in disjunctive normal form by exhaustive search ⋮ Propositionalization-based relational subgroup discovery with RSD ⋮ Reducing one class of machine learning algorithms to logical operations of plausible reasoning ⋮ Hypothesis finding with proof theoretical appropriateness criteria

This page was built for publication: A study of relevance for learning in deductive databases