
Using the techniques of closures and chaotic iterations of P. Cousot and R. Cousot, the authors give a semantics to logic programs and then study some fixed point theorems, denotational semantics and the like. The final section is devoted to an extension of the characterization of SLD finite failure given by \textit{K. R. Apt} and \textit{M. H. van Emden} [J. Assoc. Comput. Mach. 29, 841-862 (1982; Zbl 0483.68004)].
Specification and verification (program logics, model checking, etc.), SLD resolution, Logic programming, semantics, chaotic iterations, SLD resolution, finite failure, Prolog, General topics in the theory of software, fixed point theorems, Theoretical Computer Science, logic programs, Abstract data types; algebraic specification, denotational semantics, Computer Science(all)
Specification and verification (program logics, model checking, etc.), SLD resolution, Logic programming, semantics, chaotic iterations, SLD resolution, finite failure, Prolog, General topics in the theory of software, fixed point theorems, Theoretical Computer Science, logic programs, Abstract data types; algebraic specification, denotational semantics, Computer Science(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 84 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
