Name
Abstract | ||
|---|---|---|
Three orthogonal memoing techniques for deterministic logic programs are introduced and evaluated on the basis of their empirical performance. They share the same basic idea: efficient memoing is achieved by losing information gracefully, i.e., memoing benefits from a form of abstraction. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0743-1066(96)00105-7 | The Journal of Logic Programming |
Keywords | Field | DocType |
composition operator,indexation | Hit rate,Discrete mathematics,Programming language,Computer science,Oracle,Algorithm,Search engine indexing,Delphi,Composition operator,Recursion,Lemma (mathematics),Speedup | Journal |
Volume | Issue | ISSN |
30 | 2 | 0743-1066 |
Citations | PageRank | References |
3 | 0.37 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Tarau | 1 | 1529 | 113.14 |
| Koen De Bosschere | 2 | 1659 | 117.74 |
| bart demoen | 3 | 956 | 77.58 |