Efficient Data Structures for Inductive Logic Programming

Nuno Fonseca, Ricardo Rocha, Fernando Silva and Rui Camacho

September/October 2003

---

Abstract

This work aims at improving the scalability of memory usage in Inductive Logic Programming systems. In this context, we propose two efficient data structures: the Trie, used to represent lists and clauses; and the RL-Tree, a novel data structure used to represent the clauses coverage. We evaluate their performance in the April system using well known datasets. Initial results show a substantial reduction in memory usage without incurring extra execution time overheads. Our proposal is applicable in any ILP system.

Bibtex

@InProceedings{fonseca-ilp03,
  author =    {N. Fonseca and R. Rocha and R. Camacho and F. Silva},
  title =     {{Efficient Data Structures for Inductive Logic Programming}},
  booktitle = {Proceedings of the 13th International Conference on Inductive Logic Programming (ILP 2003)},
  pages =     {130--145},
  number =    {2835},
  series =    {LNAI},
  publisher = {Springer},
  editor =    {T. Horváth and A. Yamamoto},
  month =     {September/October},
  year =      {2003},
  address =   {Szeged, Hungary},
}

Download Paper

PDF file
Springer