On combining linear-based strategies for tabled evaluation of logic programs

• Type: Article in International Scientific Journal
• Date: 2011

Authors

Miguel Areias (Author) Other; Ricardo Rocha (Author) FCUP

Journal

Title: Theory and Practice of Logic Programming

Vol. 11

Pages: 681-696

ISSN: 1471-0684

Publisher: Cambridge University Press

Indexing

ISI Web of Knowledge - 3 Citations

Scopus - 5 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-002-Q2N

DOI: 10.1017/s147106841100024x

Abstract (EN): Tabled evaluation is a recognized and powerful technique that overcomes some limitations of traditional Prolog systems in dealing with recursion and redundant subcomputations. We can distinguish two main categories of tabling mechanisms: suspension-based tabling and linear tabling. While suspension-based mechanisms are considered to obtain better results in general, they have more memory space requirements and are more complex and harder to implement than linear tabling mechanisms. Arguably, the SLDT and Dynamic Reordering of Alternatives (DRA) strategies are the two most successful extensions to standard linear tabled evaluation. In this work, we propose a new strategy, named dynamic reordering of solutions, and we present a framework, on top of the Yap system, that supports the combination of all these three strategies. Our implementation shares the underlying execution environment and most of the data structures used to implement tabling in Yap. We thus argue that all these common features allows us to make a first and fair comparison between these different linear tabling strategies and, therefore, better understand the advantages and weaknesses of each, when used solely or combined with the others.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 16