Document Open Access Logo

Higher-order Logic Learning and lambda-Progol

Author Niels Pahlavi

Thumbnail PDF


  • Filesize: 341 kB
  • 5 pages

Document Identifiers

Author Details

Niels Pahlavi

Cite AsGet BibTex

Niels Pahlavi. Higher-order Logic Learning and lambda-Progol. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 281-285, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)


We present our research produced about Higher-order Logic Learning (HOLL), which consists of adapting First-order Logic Learning (FOLL), like Inductive Logic Programming (ILP), within a Higher-order Logic (HOL) context. We describe a first working implementation of lambda-Progol, a HOLL system adapting the ILP system Progol and the HOL formalism lambda-Prolog. We compare lambda-Progol and Progol on the learning of recursive theories showing that HOLL can, in these cases, outperform FOLL.
  • Inductive Logic Programming
  • Progol
  • Higher-order Logic
  • Higher-order Logic Learning
  • $lambda$Prolog


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail