Parallel Processing of Resolution
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.
Cite
Text
Yamaguchi et al. "Parallel Processing of Resolution." International Joint Conference on Artificial Intelligence, 1985.Markdown
[Yamaguchi et al. "Parallel Processing of Resolution." International Joint Conference on Artificial Intelligence, 1985.](https://mlanthology.org/ijcai/1985/yamaguchi1985ijcai-parallel/)BibTeX
@inproceedings{yamaguchi1985ijcai-parallel,
title = {{Parallel Processing of Resolution}},
author = {Yamaguchi, Takahira and Tezuka, Yoshikazu and Kakusho, Osamu},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1985},
pages = {1178-1180},
url = {https://mlanthology.org/ijcai/1985/yamaguchi1985ijcai-parallel/}
}