License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2010.281
URN: urn:nbn:de:0030-drops-26098
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2609/

Pahlavi, Niels

Higher-order Logic Learning and lambda-Progol

pdf-format:
Dokument 1.pdf (341 KB)


Abstract

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.

BibTeX - Entry

@InProceedings{pahlavi:LIPIcs:2010:2609,
  author =	{Niels Pahlavi},
  title =	{{Higher-order Logic Learning and lambda-Progol}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{281--285},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Manuel Hermenegildo and Torsten Schaub},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2609},
  URN =		{urn:nbn:de:0030-drops-26098},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.ICLP.2010.281},
  annote =	{Keywords: Inductive Logic Programming, Progol, Higher-order Logic, Higher-order Logic Learning, $lambda$Prolog}
}

Keywords: Inductive Logic Programming, Progol, Higher-order Logic, Higher-order Logic Learning, $lambda$Prolog
Seminar: Technical Communications of the 26th International Conference on Logic Programming
Issue date: 2010
Date of publication: 25.06.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI