Parallel algorithms for free and associative-commutative unification
A survey of algorithms for free unification is given, followed by an overview of the computability and complexity of unification problems. Second-order unification is known to be undecidable, and a proof is given that the first-order problem is also undecidable under an arbitrary set of axioms. A n...
| 第一著者: | |
|---|---|
| その他の著者: | |
| フォーマット: | 学位論文 |
| 言語: | English |
| 出版事項: |
1989
|
| 主題: |