The computational complexity of unification in first-order logic under parallel computation scheme is discussed. A parallel unification algorithm is presented on a combinational logic circuit model and its complexity is analyzed. In order to discuss the lower bound of parallel time complexity of unification, we show that unification is the one of the hardest problems in the class of problems resolved by polynomial size circuits. Namely, it seems to be difficult to design very efficient parallel algorithm for unification.
|ホスト出版物のタイトル||Unknown Host Publication Title|
|出版ステータス||出版済み - 12月 1 1984|
!!!All Science Journal Classification (ASJC) codes