TO
1 - 25 of 3
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 1 |
 | Freire, Juliana | Combining scheduling strategies in tabled evaluations | 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 th... | SLG; SLG-WAM; Tabling; Local scheduling; Batched scheduling | 1997 |
| 2 |
 | Freire, Juliana | Parallelizing tabled evaluations | SLG is a table-oriented resolution method that extends SLD evaluation in two ways. It computes the well-founded model for logic programs with negation with polynomial data complexity,and it terminates for programs with the bounded-term-size property. Furthermore SLG has an efficient sequential imple... | Parallel logic programming; Tabling; Table parallelism; SLG; XSB | 1994 |
| 3 |
 | Freire, Juliana | Taking I/O seriously: resolution reconsidered for disk | Modern compilation techniques can give Prolog programs, in the best cases, a speed comparable to C. However, Prolog has proven to be unacceptable for data-oriented queries for two major reasons: its poor termination and complexity properties for Datalog, and its tuple-at-a-time strategy. A number of... | Tabling; SLG-WAM; Prolog; XSB; Datalog | 1997 |
1 - 25 of 3