Cantitate/Preț
Produs
Total produse
Vezi coșul
Logic Programming and Nonmonotonic Reasoning: Fourth International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings de Ulrich Furbach

Logic Programming and Nonmonotonic Reasoning: Fourth International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings: Lecture Notes in Computer Science, cartea 1265

Editat de Ulrich Furbach, Anil Nerode
en Limba Engleză Paperback – 2 iul 1997
This book constitutes the refereed proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR '97, held in Dagstuhl Castle, Germany, in July 1997.
The volume presents 19 revised regular papers together with 10 system descriptions and five abstracts of invited presentations. The papers included report state-of-the-art research and development in the interdisciplinary area of logic programming and logical foundations of artificial intelligence.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32307 lei

Preț vechi: 40384 lei
-20% Nou

Puncte Express: 485
Preț estimativ în valută:
6185€ • 6737$ • 5188£

Carte tipărită la comandă

Livrare economică 18 decembrie 24 - 01 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540632559
ISBN-10: 3540632557
Pagini: 472
Ilustrații: XI, 461 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.65 kg
Ediția:1997
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

Forward and backward chaining in constraint programming.- Strong and weak constraints in disjunctive datalog.- Nonmonotonic reasoning with quantified boolean constraints.- Improving the alternating fixpoint: The transformation approach.- Is non-monotonic reasoning always harder.- Complexity of only knowing: The prepositional case.- Affordable classes of normal logic programs.- Automated reasoning with nonmonotonic logics.- Simulations between programs as cellular automata.- Separating disbeliefs from beliefs in autoepistemic reasoning.- Power defaults (preliminary report).- A study of Przymusinski's static semantics.- Resolution for skeptical stable semantics.- Computing non-ground representations of stable models.- Industry needs for integrated information services.- Computing, solving, proving: A report on the Theorema project.- Towards a systematic approach to representing knowledge in declarative logic programming.- A paraconsistent semantics with contradiction support detection.- On conservative enforced updates.- A general framework for revising nonmonotonic theories.- Composing general logic programs.- Modular logic programming and generalized quantifiers.- Programs with universally quantified embedded implications.- Generalized query answering in disjunctive deductive databases: Procedural and nonmonotonic aspects.- DisLoP: Towards a disjunctive logic programming system.- REVISE: Logic programming and diagnosis.- A deductive system for non-monotonic reasoning.- The deductive database system LOLA.- ACLP: Flexible solutions to complex problems.- Nonmonotonic reasoning in FLORID.- GLUE: Opening the world to theorem provers.- Smodels — an implementation of the stable model and well-founded semantics for normal logic programs.- XSB: A system for efficientlycomputing well-founded semantics.- An implementation platform for query-answering in default logics: The XRay system, its implementation and evaluation.