Non-monotonic extensions of logic programming : ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994 : selected papers
Author(s)
Bibliographic Information
Non-monotonic extensions of logic programming : ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994 : selected papers
(Lecture notes in computer science, 927 . Lecture notes in artificial intelligence)
Springer-Verlag, c1995
- : gw
- : us
Available at 55 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"ICLP '94, the Eleventh International Conference on Logic Programming" -- Pref
Includes bibliographical references
Description and Table of Contents
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.
Table of Contents
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.
by "Nielsen BookData"