A Note on Trailing in the SLG-WAM (ResearchIndex)

See this document in CiteSeerX!

A Note on Trailing in the SLG-WAM (Make Corrections)
Terrance Swift Dept. of Computer Science SUNY Stony Brook Stony Brook, NY

Home/Search Context Related

Rate this article:

(Enter summary)
Abstract: Introduction A tabled evaluation of a logic program may have states in which answers are consumed by more than one computation path. Such a situation may arise due to cyclic dependencies among various tabled subgoals. Accordingly, an implementation of tabling must maintain environments for multiple computation paths, and support the suspension and resumption of such computation paths. As noted in [2], the SLG-WAM, accomplishes this by sharing the WAM Local Stack, Global Stack, Trail, and... (Update)

Active bibliography (related documents): More All
0.2: Alternatives for compile run in the WAM - Remko Troncon Gerda (Correct)
0.2: Copying garbage collection for the WAM: to mark or not to.. - Demoen, Nguyen.. (Correct)
0.2: Copying garbage collection for the WAM: - To Mark Or (Correct)

Similar documents based on text: More All
0.5: Memory Management and Scheduling in a Tabling Engine - Castro, Swift, Warren (2001) (Correct)
0.3: Analysis of SLG-WAM Evaluation of Definite Programs - Swift, Warren (Correct)
0.3: Cv - Cui (Correct)

BibTeX entry: (Update)

@misc{ dept-note,
  author = "Terrance Swift Dept",
  title = "A Note on Trailing in the SLG-WAM",
  url = "citeseer.ist.psu.edu/601529.html" }