Enumeration operators and modular logic programming

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

Abstract

An operational and a minimal model semantics for logic programming modules is introduced. It is shown that this semantics corresponds to the recursion theoretic notion of enumeration operator. Basic operations on modules, such as composition and recursion, are discussed. The adequacy of these operations is established by showing that all logic programming can be done, in principle, by combining certain elementary modules using these basic operations.

Cited by (0)

Partial support received from NSF grant DCR 8504825.