Compact representation of knowledge bases in ILP

DOI10.1007/3-540-36468-4_17MaRDI QIDQ4413496zbMATH OpenFDO

Authors Jan Struyf, Jan Ramon, Hendrik Blockeel

Publication date 20 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2583/25830254.htm, https://lirias.kuleuven.be/handle/123456789/123802

Mathematics Subject Classification ID

Logic programming (68N17) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Compact representation of knowledge bases in inductive logic programming
• A note on two simple transformations for improving the efficiency of an ILP system
• A simple heuristic for knowledge base compression
• Taming the complexity of inductive logic programming
• A Statistical Approach to Incremental Induction of First-Order Hierarchical Knowledge Bases

Cited in

(2)

• Learning goal hierarchies from structured observations and expert annotations
• Compact representation of knowledge bases in inductive logic programming

This page was built for publication: Compact representation of knowledge bases in ILP

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