This paper surveys the main results appearing in the literature on the computational
complexity of non-monotonic inference tasks. We not only give results about the …

A general logic program (abbreviated to “program” hereafter) is a set of roles that have both
positive and negative subgoals. It is common to view a deductive database as a general …

This paper addresses complexity issues for important problems arising with disjunctive logic
programming. In particular, the complexity of deciding whether a disjunctive logic program is …

In this paper, we review recent work aimed at the application of declarative logic
programming to knowledge representation in artificial intelligence. We consider extensions …

Logic programming and negation: A survey - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full …

The focus of this paper is nonmonotonic reasoning as it relates to logic programming. I
discuss the prehistory of nonmonotonic reasoning, starting from approximately 1958. I then …

Circumscription and the closed-world assumption with its variants are well-known
nonmonotonic techniques for reasoning with incomplete knowledge. Their complexity in the …

The observation that it is frequently impossible to obtain complete information in the context
of database applications has motivated a substantial literature seeking to extend the …

The purpose of this paper is to expand the syntax and semantics of logic programs and
disjunctive databases to allow for the correct representation of incomplete information in the …

Dealing with contradiction Page 1 8. Dealing with contradiction As we've seen before, WFSX
is not defined for every program, ie some programs are contradictory and are given no …