Inductive mercury programming

Barnaby Fisher; James Cussens

Inductive mercury programming

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English
Title of host publication	Inductive Logic Programming
Editors	S Muggleton, R Otero, A Tamaddoni-Nezhad
Place of Publication	BERLIN
Publisher	Springer
Pages	199-213
Number of pages	15
ISBN (Print)	978-3-540-73846-6
Publication status	Published - 2007
Event	16th International Conference on Inductive Logic Programming - Santiago de Compostela Duration: 24 Aug 2006 → 27 Aug 2006

Conference

Conference	16th International Conference on Inductive Logic Programming
City	Santiago de Compostela
Period	24/08/06 → 27/08/06

Cite this

@inproceedings{b86eee4696644be98890aac6e37abac4,

title = "Inductive mercury programming",

abstract = "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.",

author = "Barnaby Fisher and James Cussens",

year = "2007",

language = "English",

isbn = "978-3-540-73846-6",

pages = "199--213",

editor = "S Muggleton and R Otero and A Tamaddoni-Nezhad",

booktitle = "Inductive Logic Programming",

publisher = "Springer",

address = "Germany",

note = "16th International Conference on Inductive Logic Programming ; Conference date: 24-08-2006 Through 27-08-2006",

}

TY - GEN

T1 - Inductive mercury programming

AU - Fisher, Barnaby

AU - Cussens, James

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

M3 - Conference contribution

SN - 978-3-540-73846-6

SP - 199

EP - 213

BT - Inductive Logic Programming

A2 - Muggleton, S

A2 - Otero, R

A2 - Tamaddoni-Nezhad, A

PB - Springer

CY - BERLIN

T2 - 16th International Conference on Inductive Logic Programming

Y2 - 24 August 2006 through 27 August 2006

ER -