Muutke küpsiste eelistusi

Logic Programming and Nonmonotonic Reasoning: Fourth International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings 1997 ed. [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 461 pages, kõrgus x laius: 235x155 mm, kaal: 1450 g, XI, 461 p., 1 Paperback / softback
  • Sari: Lecture Notes in Artificial Intelligence 1265
  • Ilmumisaeg: 02-Jul-1997
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540632557
  • ISBN-13: 9783540632559
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 461 pages, kõrgus x laius: 235x155 mm, kaal: 1450 g, XI, 461 p., 1 Paperback / softback
  • Sari: Lecture Notes in Artificial Intelligence 1265
  • Ilmumisaeg: 02-Jul-1997
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540632557
  • ISBN-13: 9783540632559
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.

Muu info

Springer Book Archives
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.