{"type":"ScholarlyArticle","title":"Parallel Processing of Resolution","authors":[{"name":"Takahira Yamaguchi","slug":"takahira-yamaguchi","given":"Takahira","family":"Yamaguchi","affiliation":""},{"name":"Yoshikazu Tezuka","slug":"yoshikazu-tezuka","given":"Yoshikazu","family":"Tezuka","affiliation":""},{"name":"Osamu Kakusho","slug":"osamu-kakusho","given":"Osamu","family":"Kakusho","affiliation":""}],"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 .","doi":null,"url":"https://ijcai.org/proceedings/1985/239","pdf":"https://ijcai.org/proceedings/1985/0239.pdf","markdown":"https://ijcai.org/proceedings/1985/239.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/239","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":239,"pages":{"first":1178,"last":1179},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}