Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/67438
Full metadata record
DC FieldValueLanguage
dc.creatorNuno Fonseca
dc.creatorVítor Santos Costa
dc.creatorFernando Silva
dc.creatorRui Camacho
dc.date.accessioned2019-01-31T22:42:10Z-
dc.date.available2019-01-31T22:42:10Z-
dc.date.issued2003
dc.identifier.othersigarra:64563
dc.identifier.urihttps://repositorio-aberto.up.pt/handle/10216/67438-
dc.description.abstractInductive Logic Programming (ILP) is a Machine Learning technique that hasbeen quite successful in knowledge discovery for relational domains. ILP systemsimplemented in Prolog challenge the limits of Prolog systems due to heavy usageof resources such as database accesses and memory usage, and to very longexecution times. The major reason to implement ILP systems in Prolog is thatthe inference mechanism implemented by the Prolog engine is fundamental tomost ILP learning algorithms. ILP systems can therefore benefit from the extensiveperformance improvement work that has taken place for Prolog. On theother hand, ILP is a non-classical Prolog application because it uses large setsof ground facts and requires storing a large search tree.One major criticism of ILP systems is that they often have long runningtimes. A technique that tries to tackle this problem is coverage caching [?]. Coveragecaching stores previous results in order to avoid recomputation. Naturally,this technique uses the Prolog internal database to store results. The questionis: does coverage caching successfully reduce the ILP systems running time?To obtain an answer to this question we evaluated the impact of the coveragecaching technique using the April [?] ILP system with the YAP Prolog system.To understand the results obtained we profiled Aprils execution and presentinitial results. The contribution of this paper is twofold: to an ILP researcher itprovides an evaluation of the coverage caching technique implemented in Prologusing well known datasets; to a Prolog implementation researcher it shows theneed of efficient internal database indexing mechanisms.
dc.language.isoeng
dc.relation.ispartof11th Portuguese Conference on Artificial Intelligence (EPIA 2003)
dc.rightsopenAccess
dc.rights.urihttps://creativecommons.org/licenses/by-nc/4.0/
dc.subjectEngenharia de computadores, Engenharia electrotécnica, electrónica e informática
dc.subjectComputer engineering, Electrical engineering, Electronic engineering, Information engineering
dc.titleExperimental evaluation of a caching technique
dc.typeArtigo em Livro de Atas de Conferência Internacional
dc.contributor.uportoFaculdade de Engenharia
dc.subject.fosCiências da engenharia e tecnologias::Engenharia electrotécnica, electrónica e informática
dc.subject.fosEngineering and technology::Electrical engineering, Electronic engineering, Information engineering
Appears in Collections:FEUP - Artigo em Livro de Atas de Conferência Internacional

Files in This Item:
File Description SizeFormat 
64563.pdfExperimental Evaluation of a Caching Technique122.24 kBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons