scientific article; zbMATH DE number 1753138

zbMATH Open0994.68024MaRDI QIDQ4533346FDOQ4533346

Authors: Hendrik Blockeel, Luc Dehaspe, Bart Demoen, Gerda Janssens, Jan Ramon, Henk Vandecasteele 

Publication date: 10 June 2002

Title of this publication is not available (Why is that?)

Recommendations

• Taming the complexity of inductive logic programming
• Efficient and Scalable Induction of Logic Programs Using a Deductive Database System
• scientific article; zbMATH DE number 898233
• Efficient program synthesis using constraint satisfaction in inductive logic programming
• 10.1162/153244304773633861
• scientific article; zbMATH DE number 1368930
• Inductive logic programming beyond logical implication

zbMATH Keywords

inductive logic programmingrelational learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Logic programming (68N17)

Cited In (10)

• Inductive Logic Programming
• Block-wise construction of tree-like relational features with monotone reducibility and redundancy
• Title not available (Why is that?)
• 10.1162/153244304773936027
• Title not available (Why is that?)
• Seeing the Forest Through the Trees
• Title not available (Why is that?)
• ILP :- Just Trie It
• Crossclus: user-guided multi-relational clustering
• First order random forests: Learning relational classifiers with complex aggregates

Uses Software

• SLIQ

This page was built for publication:

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