Combining scheduling strategies in tabled evaluations

Update item information
Publication Type Journal Article
School or College College of Engineering
Department Computing, School of
Creator Freire, Juliana
Other Author Warren, David S.
Title Combining scheduling strategies in tabled evaluations
Date 1997
Description Tabled evaluations ensure termination for Datalog programs by distinguishing calls to tabled subgoals. Given several variant subgoals in an evaluation, only the first (the generator) will use program clause resolution, the rest (consumers) must perform answer resolution using answers computed by the original invocation. This use of answer resolution prevents the possibility of infinite looping for Datalog programs, which sometimes occurs in SLD. As variant subgoals can be called at different stages of the evaluation, there is an intrinsic asynchronism between the generation and consumption of answers in SLG. Given this asynchrony, implementations of tabled logic programs face an important scheduling choice not present in traditional top-down evaluation: When to return answers to consumer subgoals.
Type Text
Publisher Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages
First Page 1
Last Page 15
Subject SLG; SLG-WAM; Tabling; Local scheduling; Batched scheduling
Subject LCSH Logic programming; Computer scheduling
Language eng
Bibliographic Citation Freire, J., & Warren, D. S. (1997). Combining scheduling strategies in tabled evaluations. Proceedings of the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, 1-15.
Rights Management (c)Freire, J., & Warren, D. S.
Format Medium application/pdf
Format Extent 1,405,443 bytes
Identifier ir-main,12387
ARK ark:/87278/s67s85wc
Setname ir_uspace
Date Created 2012-06-13
Date Modified 2012-06-13
ID 702960
Reference URL https://collections.lib.utah.edu/ark:/87278/s67s85wc
Back to Search Results