Processing Declarative Knowledge: International Workshop Pdk '91, Kaiserslautern, Germany, July 1-3, 1991. Proceedings

Michael M. Richter et Harold Boley

ISBN 10: 354055033X / ISBN 13: 9783540550334

Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1991

Riguardo questo articolo

Ancien livre de bibliothèque. Traces d'usure sur la couverture. Petite(s) trace(s) de pliure sur la couverture. Edition 1991. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Slightly creased cover. Edition 1991. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo D-568-500

Dati bibliografici

Titolo: Processing Declarative Knowledge: ...

Casa editrice: Springer-Verlag Berlin and Heidelberg GmbH & Co. K

Data di pubblicazione: 1991

Legatura: Softcover

Condizione: Bon

Descrizione articolo

Riassunto:

This volume presents the proceedings of an internationalworkshop on the processing of declarative knowledge. Theworkshop was organized and hosted by the German ResearchCenter for Artificial Intelligence (DFKI) in cooperationwith the Association for Logic Programming (ALP) and theGesellschaft f}r Informatik (GI).Knowledge is often represented using definite clauses,rules, constraints, functions, conceptual graphs, andrelated formalisms. The workshop addressed such high-levelrepresentations and their efficient implementation requiredfor declarative knowledge bases. Many of the papers treatrepresentation methods, mainly concept languages, and manytreat implementation methods, such as transformationtechniques and WAM-like abstract machines. Several papersdescribe implemented knowledge-processing systems. Thecompetition between procedural and declarative paradigms wasdiscussed in a panel session, and position statements of thepanelists are included in the volume.

Contenuti:

Efficient processing of declarative rule-based languages for Databases.- Has dedicated hardware for Prolog a future ?.- Commercial applications of large Prolog knowledge bases.- Compiling conceptual graphs.- Subsumption in knowledge graphs.- A terminological knowledge representation system with complete inference algorithms.- An introduction to dynamic concept systems.- Querying concept-based knowledge bases.- Subsumption computation in an object-oriented data model.- A concise presentation of ITL.- Distributed disjunctions for LIFE.- Reasoning with maximal time intervals.- Nonclassical models for logic programs.- Logical operational semantics of Parlog part I: And-Parallelism.- A tool for building connectionist-like networks based on term unification.- Providing declarative access to a processing system for satellite image data.- Declarative functionality descriptions of interactive reasoning modules.- Rule-aided constraint resolution in Laure.- Flang: A functional-logic language.- Processing functional definitions as declarative knowledge: A reduced bytecode implementation of a functional logic machine.- Reducing scheduling overheads for concurrent logic programs.- A general framework for knowledge compilation.- Data-driven transformation of meta-interpreters: A sketch.- Improving the efficiency of constraint logic programming languages by deriving specialized versions.- Parallelizing Prolog on shared-memory multiprocessors.- Processing abductive reasoning via Contextual Logic Programming.- Efficient implementation of narrowing and rewriting.- Tim: The toulouse inference machine for non-classical logic programming.- Declarative and procedural paradigms-do they really compete?.- The GCLA II programming language.- A brief description of the PROTOS-L system.- PCPL — PROLOG constraint processing library version 2.0.- A mini-description of the ITL system.- Taxon: A concept language with concrete domains.- The ALF system: An efficient implementation of a functional logic language.- Transforming horn clauses for forward reasoning.- Implementation of the functional-logic language flang.- SEPIA 3.0 — An extensible prolog system.- FIDO: Exploring finite domain consistency techniques in logic programming.