Parallelization in Inference Systems: International Workshop Dagstuhl Castle, Germany, December 17–18, 1990 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This volume contains the proceedings of an international workshop on parallelism in inference systems held in Germany in December 1990. The topicof the workshop is still rather young and several papers in the book are overview articles intended to provide a first orientation toward some of the more intensively investigated subtopics. The main part of the book is a compilation of research papers on parallelization in special domains ofinference such as rewriting, automatic reasoning, logic programming, andconnectionist inference. Appended to the book is a collection of short project summaries received in response to a worldwide email call. The book is intended primarily for researchers working on inference systems who are interested in parallelizing their systems.

Author(s): Franz Kurfeß (auth.), B. Fronhöfer, G. Wrightson (eds.)
Series: Lecture Notes in Computer Science 590
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1992

Language: English
Pages: 378
Tags: Artificial Intelligence (incl. Robotics); Programming Techniques; Processor Architectures

Potentiality of parallelism in logic....Pages 1-25
Parallel theorem provers An overview....Pages 26-50
Parallel unification: Theory and implementations....Pages 51-81
Connectionist inference systems....Pages 82-120
Implementing parallel rewriting....Pages 121-138
Experiments with Roo, a parallel automated deduction system....Pages 139-162
A process algebra over the Herbrand Universe: Application to parallelism in automated deduction....Pages 163-181
Using the Reform inference system for parallel Prolog....Pages 182-194
Random competition: A simple, but efficient method for parallelizing inference systems....Pages 195-209
Parallel and efficient implementation of the compartmentalized connection graph proof procedure: Resolution to unification....Pages 210-233
Constraint satisfaction via partially parallel propagation steps....Pages 234-242
A parallel theorem prover with heuristic work distribution....Pages 243-252
Non-WAM models of logic programming and their support by novel parallel hardware....Pages 253-269
The adam abstract dataflow machine....Pages 270-289
Parallel computation model for parallel prolog....Pages 290-302
Application of connectionist models to fuzzy inference systems....Pages 303-317
CHCL — A connectionist inference system....Pages 318-342
Project Summaries....Pages 343-372