Inductive mercury programming

Barnaby Fisher, James Cussens

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We investigate using the Mercury language to implement and design ILP algorithms, presenting our own ILP system IMP. Mercury provides faster execution than Prolog. Since Mercury is a purely declarative language, run-time assertion of induced clauses is prohibited. Instead IMP uses a problem-specific interpreter of ground representations of induced clauses. The interpreter is used both for cover testing and bottom clause generation. The Mercury source for this interpreter is generated automatically from the user's background knowledge using Moose, a Mercury parser generator. Our results include some encouraging results on IMP's cover testing speed, but overall IMP is still generally a little slower than ALEPH.

Original languageEnglish
Title of host publicationInductive Logic Programming
EditorsS Muggleton, R Otero, A Tamaddoni-Nezhad
Place of PublicationBERLIN
Number of pages15
ISBN (Print)978-3-540-73846-6
Publication statusPublished - 2007
Event16th International Conference on Inductive Logic Programming - Santiago de Compostela
Duration: 24 Aug 200627 Aug 2006


Conference16th International Conference on Inductive Logic Programming
CitySantiago de Compostela

Cite this