On Improving the Efficiency of Deterministic Calls and Answers in Tabled Logic Programs

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2009

Autores

Miguel Areias (Autor) FCUP; Ricardo Rocha (Autor) FCUP

Ata de Conferência Internacional

Título: Progress in Artificial Intelligence: Proceedings of the 14th Portuguese Conference on Artificial Intelligence, EPIA2009

Páginas: 113-125

14th EPIA - Portuguese Conference on Artificial Intelligence - EPIA 2009

Universidade de Aveiro, Portugal, 12 a 15 de Outubro de 2009

Indexação

ISI Web of Knowledge - 0 Citações

Scopus - 0 Citações

Classificação Científica

FOS: Ciências exactas e naturais > Ciências da computação e da informação

Outras Informações

ID Authenticus: P-003-RVE

DOI: 10.1007/978-3-642-04686-5_10

Abstract (EN): The execution model on which most tabling engines are based allocates a choice point whenever a new tabled subgoal is called. This happens even when the call is deterministic. however, sortie of the information from the choice point; is never used when evaluating deterministic tabled calls with batched scheduling. Moreover, when a deterministic answer is found for a. deterministic tabled call, the call can be completed early and the corresponding choice point can be removed. Thus, if applying batched scheduling to a long deterministic computation the system may end up consuming memory and evaluating calls unnecessarily. In this paper, we propose a solution that, tries to reduce this memory and execution overhead to a minimum. Our experimental results show that;, for deterministic tabled calls and tabled answers with batched scheduling, it; is possible not. only to reduce the memory usage overhead, but also the running time of tire execution.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 13