Add to ORKGD Various semantics for logic programs with negation are described in terms of a dualized program together with additional axioms, some of which are second-order formulas. The semantics of Clark, Fitting, and Kunen are characterized in this framework, and a finite first-order presentation of Kunen’s semantics is described. A new axiom to represent “commonsense” reasoning is proposed for logic programs. It is shown that the well-founded semantics and stable models are definable with this axiom. The roles of domain augmentation and domain closure are examined. A “domain foundation ” axiom is proposed to replace the domain closure axiom. a 1
An important limitation of traditional logic programming as a knowledge representation tool, in comp...
In this paper we propose the minimal well-founded semantics for logic programs with negation based o...
AbstractThe default approach to the theory of logic programs (and deductive databases) is based on t...
Various semantics for logic programs with negation are described in terms of a dualized program toge...
AbstractVarious semantics for logic programs with negation are described in terms of a dualized prog...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
The question how knowledge can be represented by means of logic programs with negation has been a dr...
AbstractLogic programs are considered as abductive programs with negative literals as abductive hypo...
The focus of the research is the semantics of logic programming. Concepts in the currently used sem...
AbstractWe propose a novel semantics for logic programs with negation by viewing the application of ...
AbstractClark's program completion offers an intuitive first-order semantics for logic programs. Unf...
Abstract. In the literature, there are several approaches which try to perform common sense rea-soni...
In this paper, by considering the idea that argumentation semantics can be viewed as a special form ...
Logic programming has been introduced as programming in the Horn clause subset of first-order logic....
AbstractIn this paper, it is shown that a three-valued autoepistemic logic provides an elegant unify...
An important limitation of traditional logic programming as a knowledge representation tool, in comp...
In this paper we propose the minimal well-founded semantics for logic programs with negation based o...
AbstractThe default approach to the theory of logic programs (and deductive databases) is based on t...
Various semantics for logic programs with negation are described in terms of a dualized program toge...
AbstractVarious semantics for logic programs with negation are described in terms of a dualized prog...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
The question how knowledge can be represented by means of logic programs with negation has been a dr...
AbstractLogic programs are considered as abductive programs with negative literals as abductive hypo...
The focus of the research is the semantics of logic programming. Concepts in the currently used sem...
AbstractWe propose a novel semantics for logic programs with negation by viewing the application of ...
AbstractClark's program completion offers an intuitive first-order semantics for logic programs. Unf...
Abstract. In the literature, there are several approaches which try to perform common sense rea-soni...
In this paper, by considering the idea that argumentation semantics can be viewed as a special form ...
Logic programming has been introduced as programming in the Horn clause subset of first-order logic....
AbstractIn this paper, it is shown that a three-valued autoepistemic logic provides an elegant unify...
An important limitation of traditional logic programming as a knowledge representation tool, in comp...
In this paper we propose the minimal well-founded semantics for logic programs with negation based o...
AbstractThe default approach to the theory of logic programs (and deductive databases) is based on t...