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...
| Yazar: | |
|---|---|
| Diğer Yazarlar: | |
| Materyal Türü: | Tez |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
1989
|
| Konular: |