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

by Harold Boley, Michael M. Richter

Overview

This volume presents the proceedings of an international workshop on the processing of declarative knowledge. The workshop was organized and hosted by the German Research Center for Artificial Intelligence (DFKI) in cooperation with the Association for Logic Programming (ALP) and the Gesellschaft f}r Informatik (GI). Knowledge is often represented using definite clauses, rules, constraints, functions, conceptual graphs, and related formalisms. The workshop addressed such high-level representations and their efficient implementation required for declarative knowledge bases. Many of the papers treat representation methods, mainly concept languages, and many treat implementation methods, such as transformation techniques and WAM-like abstract machines. Several papers describe implemented knowledge-processing systems. The competition between procedural and declarative paradigms was discussed in a panel session, and position statements of the panelists are included in the volume.

Product Details

ISBN-13:	9783540550334
Publisher:	Springer Berlin Heidelberg
Publication date:	12/18/1991
Series:	Lecture Notes in Computer Science , #567
Edition description:	1991
Pages:	440
Product dimensions:	6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

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.