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

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 …

At a workshop held in Toulouse, France in 1977, Gallaire, Minker and Nicolas stated that
logic and databases was a field in its own right (see [131]). This was the first time that this …

The field of disjunctive programming started approximately in 1982 and has reached its first
decade. The first result in the field was the development of the Generalized Closed World …

We present a generalisation of the relational data model based on a 4-valued
paraconsistent logic. Our data model is capable of manipulating incomplete as well as …

The use of explicit negation enhances the expressive power of logic programs by providing
a natural and unambiguous way to assert negated information about the domain being …

Abstract In [Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics
which extends the (2-valued) stable model semantics defined originally by Gelfond and …

Logic knowledge based systems (LKBS) containing at most one form of default negation and
explicit (or “classical”) negation have been studied in the literature. In this paper we describe …

Two main approaches have been followed in the literature to give a semantics to non-Horn
databases. The first one is based on considering the set of rules composing the programs as …

We present a generalization of the relational model of data in which disjunctive and negative
information can be represented explicitly and manipulated. There are situations where the …