Name
Abstract | ||
|---|---|---|
The use of tabling in logic programming has been recognized as a powerful evaluationtechnique. Currently available tabling systems are mostly based on variant checks andhence are limited in their ability to recognize reusable subcomputations. Tabling systemsbased on call subsumption can yield superior performance by recognizing a larger set ofreusable computations. However, a straightforward adaptation of the mechanisms usedin variant-based systems to reuse these computations can in fact... |
Year | Venue | Field |
|---|---|---|
1996 | JICSLP | Programming language,Computer science,Thread (computing) |
DocType | Citations | PageRank |
Conference | 17 | 1.06 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Prasad Rao | 1 | 330 | 21.08 |
| C. R. Ramakrishnan | 2 | 1427 | 107.75 |
| I. V. Ramakrishnan | 3 | 1969 | 214.75 |