AbstractThe treatment of negation and negative information in a logic programming environment has turned out to be a major problem. We introduce a relativized version of Reiter's closed world assumption and study it from a logical point of view. In particular, we look at the questions of consistency and conservative extension
The introduction of negation in rule bodies of logic programs may lead to semantic ambiguities: Norm...
In this paper, the relationship between argumentation and closed world reasoning for disjunctive inf...
This paper deals with contradictory information in common-sense reasoning. It is often the case that...
AbstractTwo main approaches have been followed in the literature to give a semantics to non-Horn dat...
Two main approaches have been followed in the literature to give a semantics to non-Horn databases. ...
AbstractWe survey here various approaches which were proposed to incorporate negation in logic progr...
In this work we generalize the semantics for negation in logic programs, putting together the constr...
We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negatio...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
AbstractDue to the usual incompleteness of information representation, any approach to assign a sema...
. We study the semantics of disjunctive logic programs that simultaneously contain multiple kinds of...
The focus of the research is the semantics of logic programming. Concepts in the currently used sem...
An important limitation of traditional logic programming as a knowledge representation tool, in comp...
Negative information can be represented in several classes of logic programs. These approaches were ...
Due to the usual incompleteness of information representation, any approach to assign a semantics to...
The introduction of negation in rule bodies of logic programs may lead to semantic ambiguities: Norm...
In this paper, the relationship between argumentation and closed world reasoning for disjunctive inf...
This paper deals with contradictory information in common-sense reasoning. It is often the case that...
AbstractTwo main approaches have been followed in the literature to give a semantics to non-Horn dat...
Two main approaches have been followed in the literature to give a semantics to non-Horn databases. ...
AbstractWe survey here various approaches which were proposed to incorporate negation in logic progr...
In this work we generalize the semantics for negation in logic programs, putting together the constr...
We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negatio...
AbstractComplete logic programs augmented with the domain-closure axiom are proposed as the referenc...
AbstractDue to the usual incompleteness of information representation, any approach to assign a sema...
. We study the semantics of disjunctive logic programs that simultaneously contain multiple kinds of...
The focus of the research is the semantics of logic programming. Concepts in the currently used sem...
An important limitation of traditional logic programming as a knowledge representation tool, in comp...
Negative information can be represented in several classes of logic programs. These approaches were ...
Due to the usual incompleteness of information representation, any approach to assign a semantics to...
The introduction of negation in rule bodies of logic programs may lead to semantic ambiguities: Norm...
In this paper, the relationship between argumentation and closed world reasoning for disjunctive inf...
This paper deals with contradictory information in common-sense reasoning. It is often the case that...
DOI
Add to ORKG