
Non-Monotonic Extensions of Logic Programming
ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected Papers
Springer (Publisher)
Published on 20. June 1995
Book
Paperback/Softback
XII, 236 pages
978-3-540-59467-3 (ISBN)
Description
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.
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.
More details
Series
Edition
1995 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XII, 236 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 14 mm
Weight
382 gr
ISBN-13
978-3-540-59467-3 (9783540594673)
DOI
10.1007/BFb0030655
Schweitzer Classification
Content
An argumentation theoretic semantics based on non-refutable falsity.- From disjunctive programs to abduction.- Samantics of normal and disjunctive logic programs a unifying framework.- Every normal program has a nearly-stable model.- Logic programming with assumption denial.- A resolution-based procedure for default theories with extensions.- A general approach to bottom-up computation of disjunctive semantics.- Static semantics as program transformation and well-founded computation.- Magic computation for well-founded semantics.- Computing stable and partial stable models of extended disjunctive logic programs.