Name
Abstract | ||
|---|---|---|
Unnecessary backtracking is a principal source of inefficiency in Prolog execution. In orderto avoid the overhead of the general backtracking mechanism, determinate programs shouldbe executed deterministically. Achieving this requires an automatic means of extracting determinacy.We present a method in which determinacy is inferred from the success conditionsand the calling contexts of predicates. Unlike previous approaches that rely on cuts or use alimited notion of test predicates, we... |
Year | Venue | Keywords |
|---|---|---|
1993 | ICLP | extracting determinacy,logic program |
Field | DocType | ISSN |
Axiomatic semantics,Horn clause,Computer science,Algorithm,Description logic,Theoretical computer science,Bunched logic,Determinacy | Conference | 1061-0464 |
ISBN | Citations | PageRank |
0-262-73105-3 | 20 | 1.02 |
References | Authors | |
9 | 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 |
| R. C. Sekar | 4 | 2328 | 168.76 |