Non-monotonic extensions of logic programming. ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected papers (Q1894636)

The book contains extended and revised versions of the selected papers presented at the workshop on ``Non-monotonic extensions of logic programming'', held in Santa Margherita Ligure, Italy, June 1994. The 10 high quality included papers are grouped in two parts: Semantics (5 papers) and Computation (5 papers). The Semantics section comprises the following works: (1) \textit{J. J. Alferes}, \textit{L. M. Pereira} (an Argumentation theoretic semantics based on non-refutable falsity) present a new semantics for extended logic programs where default literals are viewed as arguments to a rational agent to support the program; (2) \textit{V. Lifschitz}, \textit{H. Turner} (from Disjunctive programs to abduction) deal with the problem of representing incomplete information using classical negation and epistemic disjunction versus two variants of abductive logic programming; (3) \textit{T. C. Przymusinski} (Semantics of normal and disjunctive logic programs: A unifying framework) shows that his Autoepistemic Logic of Knowledge Beliefs (AELB) isomorphically contains the major semantics of normal, disjunctive and extended logic programs; (4) \textit{C. Witteveen} (Every normal program has a nearly-stable model) investigates the inconsistency problem of the stable semantics, and presents two simple syntactic transformations, shifting and condensation, tha allow to transform any program into another one having at least one stable model; (5) \textit{J.-H. Yan}, \textit{L. Y. Yuan} (Logic programming with assumption denial) define a framework which is able to explicitly represent defeats of assumptions (assumption denials), revealing interesting relationships between disjunctive and non-disjunctive programs. The Computation section contains the last five papers: (6) \textit{M. D. Barback}, \textit{J. Lobo} (A resolution-based procedure for default theories with extensions) define a sound and complete proof-procedure that is closely related to SLDNF and abduction-like procedures for logic programs, in order to determine if a given formula is true in all (sceptical entailment) or in some (credulous entailment) extensions of default theory; (7) \textit{S. Brass}, \textit{J. Dix} (Disjunctive semantics) describe a method for deriving bottom-up query evaluation algorithms from the abstract properties of the underlying negation semantics; (8) \textit{S. Constantini}, \textit{G. A. Lanzarone} (Static semantics as program transformation and well-founded computation) expose a general framework of computing semantics for disjunctive logic programs that are similar to the static semantics; (9) \textit{L. Degerstedt}, \textit{U. Nilsson} (Magic computation for well-founded semantics) introduce a new magic templates transformation and show a step-by-step correspondence between the naive bottom-up evaluation of the transformed program and a class of top-down search strategies; (10) \textit{C. Ruiz}, \textit{J. Minker} (Computing stable and partial stable models of extended disjunctive logic programs) describe a procedure that transforms the program into a constrained-disjunctive program without any non-monotonic negation such that the classical minimal models of the transformed program correspond to the set of partial stable models of the original program.