抄録
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 |
| 出版者 | Ohmsha Ltd |
| ページ | 235-243 |
| ページ数 | 9 |
| ISBN（印刷物） | 4274072215 |
| 出版物ステータス | 出版済み - 1984 |
| 外部発表 | Yes |
Fingerprint
All Science Journal Classification (ASJC) codes
- Engineering(all)
これを引用
ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION. / Yasuura, Hiroto.
Unknown Host Publication Title. Ohmsha Ltd, 1984. p. 235-243.研究成果: 著書/レポートタイプへの貢献 › 会議での発言
}
TY - GEN
T1 - ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION.
AU - Yasuura, Hiroto
PY - 1984
Y1 - 1984
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0021650707&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0021650707&partnerID=8YFLogxK
M3 - Conference contribution
SN - 4274072215
SP - 235
EP - 243
BT - Unknown Host Publication Title
PB - Ohmsha Ltd
ER -