Name
Abstract | ||
|---|---|---|
While clause resolution is central to logic programming, practical efforts to optimizeresolution have largely concerned efficient clause indexing. One recent exception isUnification Factoring [5], which optimizes backtracking through clause heads. Herewe consider the problem of optimizing clause resolution in a more general setting thanUnification Factoring. One fundamental change is to use mode information to distinguishbetween elementary matching and unification operations that arise in... |
Year | Venue | Keywords |
|---|---|---|
1995 | ILPS | indexation |
Field | DocType | Citations |
Programming language,Unification,Theoretical computer science,Factoring,Mathematics | Conference | 7 |
PageRank | References | Authors |
0.96 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steven Dawson | 1 | 228 | 53.67 |
| C. R. Ramakrishnan | 2 | 1427 | 107.75 |
| I. V. Ramakrishnan | 3 | 1969 | 214.75 |
| Terrance Swift | 4 | 1339 | 101.50 |