A parallel resolution procedure based on connection graph

Authors:
P. Daniel Cheng;J. Y. Juang
Affiliations:
Advanced Information Services Inc., Peoria, IL;Dept. of Electrical Engineering & Computer Science, Northwestern University, Evanston, IL
Venue:
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Year:
1987

Citing 4
Cited 0

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Logic for Problem Solving

Logic for Problem Solving
Data Structures and Control Architectures for Implementation of Theorem-Proving Programs

Proceedings of the 5th Conference on Automated Deduction
Problems and Experiments for and with Automated Theorem-Proving Programs

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new approach towards a parallel resolution procedure which explores another dimension of parallelism in addition to the AND/OR formulation and special hardware constructs. The approach organizes the input clauses of a problem domain into a connection graph. The connection graph is then partitioned and each partition is worked on by a different processor of a multiprocessor system. These processors execute the resolution procedure independently on its partition, and exchange intermediate results via clause migrations. Preliminary test results and qualitative assessments of this procedure are also given.