Efficient data structures for inductive logic programming
This work aims at improving the scalability of memory usage in Inductive Logic Programming systems. In this context, we propose two ecient 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...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2003
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/74162 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/74162 |