Cantitate/Preț
Produs

Non-Monotonic Extensions of Logic Programming: ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected Papers: Lecture Notes in Computer Science, cartea 927

Editat de Louis M. Pereira, Teodor C. Przymusinski
en Limba Engleză Paperback – 20 iun 1995
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32069 lei

Preț vechi: 40086 lei
-20% Nou

Puncte Express: 481

Preț estimativ în valută:
6138 6397$ 5110£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540594673
ISBN-10: 3540594671
Pagini: 248
Ilustrații: XII, 236 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.