The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that
combines results of Logic Programming and Defeasible Argumentation. DeLP provides the …

We present a new and general approach for defining, understanding, and computing logic
programming semantics. We consider disjunctive programs for generality, but our results are …

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 …

We present a framework for expressing bottom-up algorithms to compute the well-founded
model of non-disjunctive logic programs. Our method is based on the notion of conditional …

Abstract Recently Brass and Dix introduced the semantics D-WFS for general disjunctive
logic programs. The interesting feature of this approach is that it is both semantically and …

Nonmonotonic reasoning | Handbook of automated reasoning skip to main content ACM Digital
Library home ACM Association for Computing Machinery corporate logo Google, Inc. (search) …

We describe the fields of disjunctive logic programming and disjunctive deductive databases
from the time of their inception to the current time. Contributions with respect to semantics …

Incomplete information has been studied in-depth in relational databases and knowledge
representation. In the context of the Web, incomplete information issues have been studied …

In this overview we show how Knowledge Representation (KR) can be done with the help of
generalized logic programs. We start by introducing the core of PROLOG, which is based on …

Recently, Brass and Dix showed (J. Automat. Reason. 20 (1)(1998) 143–165) that the well
founded semantics WFS can be defined as a confluent calculus of transformation rules. This …