Foundations of deductive databases and logic programming
A logical analysis of modules in logic programming
Journal of Logic Programming
Adding negation-as-failure to intuitionistic logic programming
Proceedings of the 1990 North American conference on Logic programming
What is failure?: an approach to constructive negation
Acta Informatica
Negation and constraint logic programming
Information and Computation
Institutions for logic programming
Theoretical Computer Science - Special issue: algebraic development techniques
A transformational semantics of static embedded implications of normal logic programs
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
| Hi-index | 0.00 |
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.