Higher-order logic learning and Progol

DOI10.4230/LIPICS.ICLP.2010.281MaRDI QIDQ2883107zbMATH OpenOpenAlexFDO

Authors Niels Pahlavi

Publication date 11 May 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_2961.html

zbMATH Keywords

\(\lambda\)Progol\(\lambda\)Prologhigher-order logichigher-order logic learninginductive logic programmingProgol

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Logic programming (68N17) Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27)

Recommendations

• Can HOLL outperform FOLL?
• Learning higher-order logic programs
• Higher-order Horn clauses
• HiLog: A foundation for higher-order logic programming
• Programming with higher-order logic.

Cited in

(4)

• Integrating multiple learning strategies in first order logics
• Learning higher-order logic programs
• HOL-\(\lambda\sigma\): An intentional first-order expression of higher-order logic
• Can HOLL outperform FOLL?

This page was built for publication: Higher-order logic learning and \(\lambda\)Progol

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