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...

全面介紹

書目詳細資料
主要作者: Hains, G
其他作者: McColl, B
格式: Thesis
語言:English
出版: 1989
主題:

相似書籍