A new methodology has been proposed which allows one to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded semantics can formally be understood as a stratified version of the Fitting (or Kripke–Kleene) semantics. The constructions leading to this result, however, show a certain asymmetry which is not readily understood. We study this situation here with the result that we obtain a coherent picture of relations between different semantics for normal logic programs
After a historical introduction, the bulk of the thesis concerns the study of a declarative semantic...
This paper gives the presentation of the research in the field of clas-sifying the semantics of logi...
AbstractThe different semantics that can be assigned to a logic program correspond to different assu...
A new methodology has been proposed which allows one to derive uniform characterizations of differen...
While the stable model semantics, in the form of Answer Set Programming, has become a successful sem...
While the stable model semantics, in the form of Answer Set Programming, has become a successful sem...
We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negatio...
Currently, the variety of expressive extensions and different semantics created for logic programs w...
AbstractThe default approach to the theory of logic programs (and deductive databases) is based on t...
AbstractIn this paper, it is shown that a three-valued autoepistemic logic provides an elegant unify...
AbstractWe suggested in Part I of this study a general logical formalism for Logic Programming based...
AbstractVarious semantics for logic programs with negation are described in terms of a dualized prog...
We develop an extensional semantics for higher-order logic programs withnegation, generalizing the t...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
AbstractWe investigate the relationship between various alternative semantics for logic programming,...
After a historical introduction, the bulk of the thesis concerns the study of a declarative semantic...
This paper gives the presentation of the research in the field of clas-sifying the semantics of logi...
AbstractThe different semantics that can be assigned to a logic program correspond to different assu...
A new methodology has been proposed which allows one to derive uniform characterizations of differen...
While the stable model semantics, in the form of Answer Set Programming, has become a successful sem...
While the stable model semantics, in the form of Answer Set Programming, has become a successful sem...
We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negatio...
Currently, the variety of expressive extensions and different semantics created for logic programs w...
AbstractThe default approach to the theory of logic programs (and deductive databases) is based on t...
AbstractIn this paper, it is shown that a three-valued autoepistemic logic provides an elegant unify...
AbstractWe suggested in Part I of this study a general logical formalism for Logic Programming based...
AbstractVarious semantics for logic programs with negation are described in terms of a dualized prog...
We develop an extensional semantics for higher-order logic programs withnegation, generalizing the t...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
AbstractWe investigate the relationship between various alternative semantics for logic programming,...
After a historical introduction, the bulk of the thesis concerns the study of a declarative semantic...
This paper gives the presentation of the research in the field of clas-sifying the semantics of logi...
AbstractThe different semantics that can be assigned to a logic program correspond to different assu...