A Simple and Efficient Implementation of Concurrent Local Tabling

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

Abstract

Newer Prolog implementations commonly offer support for multi-threading, and many also offer support for tabling. However, most implementations do not yet integrate tabling with multi-threading, and in particular do not support the sharing of a tabled computation among threads. In this paper we present algorithms to share completed tables among threads based on Concurrent Local SLG evaluation (SLG(CL)). SLG(CL) is based on the Local scheduling strategy, and is designed to support applications in which threads concurrently share tabled evaluations. Version 3.2 of XSB implements SLG(CL) in the SLG(CL)WAM, which fully supports well-founded tabled negation, construction of residual programs, tabled constraints and answer subsumption. The implementation of SLG(CL) requires significant additions to a single tabling operation only. As a result. SLG(CL) should be implementable by any tabling systems that uses Local evaluation based on the SLG-WAM or Chat engine, and may also be applicable to those using linear tabling.
Original languageUnknown
Title of host publicationLecture Notes in Computer Science
Pages264-278
DOIs
Publication statusPublished - 1 Jan 2010
EventInternational Symposium on Practical Aspects of Declarative Languages (PADL) -
Duration: 1 Jan 2010 → …

Conference

ConferenceInternational Symposium on Practical Aspects of Declarative Languages (PADL)
Period1/01/10 → …

Cite this