Name
Abstract | ||
|---|---|---|
Tabled resolution methods increase the declarativeness and efficiency of logic programs through the sharing of answer computations. In variant-based tabled logic programming systems, answer computations are shared only between calls that are identical modulo variable renaming. Subsumption-based tabling can yield superior performance by sharing answer computations between a more general (subsuming) call and specific (subsumed) calls. But realizing this potential in practice requires the... |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/10705424_19 | Fuji International Symposium on Functional and Logic Programming |
Keywords | Field | DocType |
logic programs,subsumption-based tabled evaluation,space efficient engine | Data structure,Logic program,Computer science,Modulo,Automaton,Algorithm,Theoretical computer science,Timestamp,Mesa,Trie,Computation,Distributed computing | Conference |
Volume | ISSN | ISBN |
1722 | 0302-9743 | 3-540-66677-X |
Citations | PageRank | References |
10 | 0.81 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ernie Johnson | 1 | 10 | 0.81 |
| C. R. Ramakrishnan | 2 | 1427 | 107.75 |
| I. V. Ramakrishnan | 3 | 1969 | 214.75 |
| Prasad Rao | 4 | 330 | 21.08 |