Non-monotonic extensions of logic programming. ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected papers
type: Item
instance of: scholarly article
title: Non-monotonic extensions of logic programming. ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected papers
zbMATH Open document ID: 0845.68020
published in: Lecture Notes in Computer Science
publication date: 1995-08-01T00:00:00Z
review text: 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 …
reviewed by: Neculai Curteanu
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 03B65
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 781065
zbMATH Keywords: non-monotonic logic programming
zbMATH Keywords: autoepistemic logic of knowledge belief
zbMATH Keywords: disjunctive programs
zbMATH Keywords: abductive logic programming
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bfb0030655
OpenAlex ID: W4214939201
DOI: 10.1007/BFB0030655
description: scientific article; zbMATH DE number 781065