Constructing simply recursive programs from a finite set of good examples

DOI10.1016/S0020-0190(97)00185-3MaRDI QIDQ293131zbMATH OpenOpenAlexFDO

Authors Kouichi Hirata

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019097001853?np=y

zbMATH Keywords

finite identificationinductive logic programminglearning from good examples

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 67804 (Why is no real title available?)
• scientific article; zbMATH DE number 2077150 (Why is no real title available?)
• scientific article; zbMATH DE number 2077176 (Why is no real title available?)
• scientific article; zbMATH DE number 3349329 (Why is no real title available?)
• Inductive logic programming
• On the power of inductive inference from good examples

Cited in

(2)

• scientific article; zbMATH DE number 3932374 (Why is no real title available?)
• scientific article; zbMATH DE number 4020482 (Why is no real title available?)

This page was built for publication: Constructing simply recursive programs from a finite set of good examples

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