A deterministic prolog fixpoint semantics

https://doi.org/10.1016/0743-1066(85)90014-7Get rights and content
Under an Elsevier user license
open archive

Abstract

A fixpoint semantics for PROLOG is presented that takes into account PROLOG's deterministic control structure as well as its logic features. It is applied to prove the correctness of a prime-number program based on the sieve of Eratosthenes, a program whose behavior depends critically on the sequential nature of PROLOG.

Cited by (0)

The research for this paper was partially supported by NSF grant MCS83-04959.