TO
1 - 25 of 4
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 1 |
 | Freire, Juliana | Beyond depth-first strategies: improving tabled logic programs through alternative scheduling | Tabled evaluation ensures termination for programs with finite models by keeping track of which subgoals have been called. Given several variant subgoals in an evaluation, only the fi rst one encountered will use program-clause resolution; the rest will resolve with the answers generated by the f... | Alternate scheduling; SLG-WAM; Tabled logic programs | 1998 |
| 2 |
 | Freire, Juliana | Beyond depth-first: improving tabled logic programs through alternative scheduling strategies | Tabled evaluations ensure termination of logic programs with fi nite models by keeping track of which subgoals have been called Given several variant subgoals in an evaluation, only the fi rst one encountered will use program clause resolution the rest uses answer resolution This use of answer r... | Alternate scheduling; SLG-WAM; Tabled logic programs | 1996 |
| 3 |
 | 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 |
| 4 |
 | 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 4