Semantics of normal logic programs with embedded implications.

*(English)*Zbl 1053.68541
Codognet, Philippe (ed.), Logic programming. 17th international conference, ICLP 2001, Paphos, Cyprus, November 26 – December 1, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42935-2). Lect. Notes Comput. Sci. 2237, 255-268 (2001).

Summary: The aim of our work is the definition of a model-theoretic semantics of normal logic programs with embedded implications. We first propose a quite simple operational semantics for this class of programs whose negation mechanism is the constructive negation. This semantics is used to prove the adequacy of the model-theoretic semantics. Then we define a declarative semantics for this class of programs in terms of Beth models and show that in the model class associated to every program there is a least model that can be seen as the semantics of the program, which may be built upwards as the least fixpoint of a continuous immediate consequence operator. Finally, it is proved that the operational semantics is sound and complete with respect to the least fixpoint semantics.

For the entire collection see [Zbl 0977.00040].

For the entire collection see [Zbl 0977.00040].