No label defined (Q3719861)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3949749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3949749 |
Statements
1985
0 references
logic programming
0 references
SLD-resolution
0 references
0.787338376045227
0 references
0.7577288746833801
0 references
0.7576907873153687
0 references
0.7540014386177063
0 references
[For the entire collection see Zbl 0568.00019.] This paper is concerned with logic programs that compute functions rather than relations. Since - so the authors argue - general SLD-resolution is highly nondeterministic, it is not suited for this deterministic kind of logic programs and therefore a restricted, so-called data-driven form of SLD-resolution is proposed. Data-driven SLD-resolution reduces the number of possible computations substantially and, moreover, provides the opportunity of constructing programs which are hierarchical and which can be proved to terminate finitely and uniquely. Furthermore, this data- driven evaluation strategy is shown to be complete for a large class of programs.
0 references