Parallel processing of resolution

Authors:
Takahira Yamaguchi;Yoshikazu Tezuka;Osamu Kakusho
Affiliations:
The Institute of Scientific and Industrial Research, Osaka University, Ibaragi, Osaka, Japan;Faculty of Engineering, Osaka University, Osaka, Japan;The Institute of Scientific and Industrial Research, Osaka University, Ibaragi, Osaka, Japan
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 3
Cited 1

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear unification

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Parallel inference search in logical calculus based on the algebraic programming system

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, Parallel Resolution Algorithm (PARA) is described to improve the execution efficiency in resolution process. PARA consists of two parts: parallel unification and generation of a resolvent. The first part is characteristic of PARA, which partitions whole set of expressions W into independent clusters as pre-processing and unifies each cluster in parallel. The efficient implementation for the processing peculiar to PARA is presented and checked by means of the experiment in comparison of execution efficiency of resolution. Experimental results show PARA is very effective in occurrence of many clusters.