This volume is based on papers presented during the ICLP '94 Workshop on Nonmonotonic Extensions of Logic Programming and on papers solicited afterwards from key researchers participating in the workshop. In total 10 carefully refereed, revised, full research papers on semantics and computational aspects of logic programs are included.
Logic programs rely on a nonmonotonic operator often referred to as negation by failure or negation by default. The nonmonoticity of this operator allows to apply results from the area of nonmonotonic theories to the investigation of logic programs (and vice versa). This volume is devoted to the interdependence of nonmonotonic formalisms and logic programming.
Author(s): Jürgen Dix, Louis Moniz Pereira, Teodor C. Przymusinski (eds.)
Series: Lecture Notes in Computer Science 927 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995
Language: English
Pages: 236
Tags: Theory of Computation
Introduction....Pages 1-2
An argumentation theoretic semantics based on non-refutable falsity....Pages 3-22
From disjunctive programs to abduction....Pages 23-42
Samantics of normal and disjunctive logic programs a unifying framework....Pages 43-67
Every normal program has a nearly-stable model....Pages 68-84
Logic programming with assumption denial....Pages 85-100
A resolution-based procedure for default theories with extensions....Pages 101-126
A general approach to bottom-up computation of disjunctive semantics....Pages 127-155
Static semantics as program transformation and well-founded computation....Pages 156-180
Magic computation for well-founded semantics....Pages 181-204
Computing stable and partial stable models of extended disjunctive logic programs....Pages 205-229
