Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives
Publication

Publications

An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives

Title
An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives
Type
Article in International Conference Proceedings Book
Year
2010
Authors
Miguel Areias
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Ricardo Rocha
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Conference proceedings International
Pages: 279-293
12th International Symposium on Practical Aspects of Declarative Languages
Madrid, SPAIN, JAN 18-19, 2010
Scientific classification
FOS: Natural sciences > Computer and information sciences
Other information
Authenticus ID: P-003-CBR
Abstract (EN): Tabling is a technique of resolution that overcomes some limitations of traditional Prolog systems in dealing with recursion and redundant sub-computations. We can distinguish two main categories of tabling mechanisms: suspension-based tabling and linear tabling. In suspension-based tabling, a tabled evaluation can be seen as a sequence of sub-computations that suspend and later resume. Linear tabling mechanisms maintain a single execution tree where tabled subgoals always extend the current computation without requiring suspension and resumption of sub-computations. In this work, we present a new and efficient implementation of linear tabling, but for that we have extended an already existent suspension-based implementation, the YapTab engine. Our design is based on dynamic reordering of alternatives but it innovates by considering a strategy that schedules the re-evaluation of tabled calls in a similar manner to the suspension-based strategies of YapTab. Our implementation also shares the underlying execution environment and most of the data structures used to implement tabling in YapTab. We thus argue that all these common features allows us to make a first and fair comparison between suspension-based and linear tabling and, therefore, better understand the advantages and weaknesses of each.
Language: English
Type (Professor's evaluation): Scientific
Contact: miguel-areias@dcc.fc.up.pt; ricroc@dcc.fc.up.pt
No. of pages: 15
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

On Applying Linear Tabling to Logic Programs (2010)
Thesis
MIGUEL AREIAS; Ricardo Rocha
Yet Another Lock-Free Atom Table Design for Scalable Symbol Management in Prolog (2024)
Article in International Scientific Journal
Moreno, P; Miguel Areias; Ricardo Rocha; Costa, VS
Towards multi-threaded local tabling using a common table space (2012)
Article in International Scientific Journal
Miguel Areias; Ricardo Rocha
Table space designs for implicit and explicit concurrent tabled evaluation (2018)
Article in International Scientific Journal
Miguel Areias; Ricardo Rocha

See all (30)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-19 at 20:47:27 | Privacy Policy | Personal Data Protection Policy | Whistleblowing