scientific article; zbMATH DE number 3949749
[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.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3719861)