Parallel Processing of Resolution
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Theorem Proving. Pages 1178-1179.
Abstract
I n this paper , PArallel Resolution Algorithm (PARA ) is d es crib ed to improve the execution effic i ency i n resolution process . PARA consists of two parts: parallel unification and genera t ion of a r es olv e nt . The first part is characte r i s ti c of PARA , which partitions whole set of e xpr ess ion s W into independent clust e rs as pr e- pr ocessi ng and unifies each cluster in paral l el . Th e e fficient implementation for the process in g p ec uli ar t o PARA is presented and ch ecke d by mea ns of th e experiment in c ompa ri so n of e xecution efficiency of resolu t ion . Experimental results show PARA is very ef fec tiv e i n occ urr e nce of many clusters .
@inproceedings{ijcai1985p239,
title = {Parallel Processing of Resolution},
author = {Yamaguchi, Takahira and Tezuka, Yoshikazu and Kakusho, Osamu},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {1178--1179},
year = {1985},
note = {Theorem Proving},
url = {https://ijcai.org/proceedings/1985/239},
}
TY - CPAPER TI - Parallel Processing of Resolution AU - Yamaguchi, Takahira AU - Tezuka, Yoshikazu AU - Kakusho, Osamu T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 1178 EP - 1179 UR - https://ijcai.org/proceedings/1985/239 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
