A study of relevance for learning in deductive databases

DOI10.1016/S0743-1066(99)00019-9zbMATH Open0941.68019OpenAlexW2026499370MaRDI QIDQ4262829FDOQ4262829

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

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

Cited In (8)

• 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
• Reducing one class of machine learning algorithms to logical operations of plausible reasoning
• Title not available (Why is that?)
• Novelty in deductive databases
• Propositionalization-based relational subgroup discovery with RSD
• Title not available (Why is that?)
• Hypothesis finding with proof theoretical appropriateness criteria

   Recommendations

• 10.1162/153244304773633861 👍 👎
• Title not available (Why is that?) 👍 👎
• Advances in Artificial Intelligence – SBIA 2004 👍 👎
• Logical settings for concept-learning 👍 👎
• Deductive learning 👍 👎

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

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