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 …

We present SLDNFA, an extension of SLDNF resolution for abductive reasoning on
abductive logic programs. SLDNFA solves the floundering abduction problem: nonground …

These competing approaches have resulted in some confusion about the declarative
meaning of logic programming. This paper investigates the problem and proposes an …

The abductive procedure SLDNFA is presented for normal abductive programs. The
procedure is a natural extension of SLDNF-resolution and incorporates both abduction and …

Abstract Recently, Gelfond and Lifschitz presented a formal language for representing
incomplete knowledge on actions and states, and a sound translation from this language to …

This paper supplies a computational model, via Logic Programming (LP), of counterfactual
reasoning of autonomous agents with application to morality. Counterfactuals are …

Abstract Well Founded Semantics is adequate to capture nonmonotonic reasoning if we
interpret the Well Founded model of a program P as a (possibly incomplete) view of the …

We present derivation proof procedures for ex-tended stable model semantics. Given
program II and goal G, G belongs to the well founded model of II jff there is al'FM-derivation …

We present a formal theory on the semantics of logic programs and abductive logic
programs with first order integrity constraints. The theory provides an alternative …