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 |
フォーマット: | 学位論文 |
言語: | English |
出版事項: |
1989
|
主題: |
類似資料
-
On the commutativity of the powerspace constructions
著者:: Matthew de Brecht, 等
出版事項: (2019-08-01) -
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry
著者:: Andrew M Marshall, 等
出版事項: (2015-06-01) -
Exact Unification and Admissibility
著者:: George Metcalfe, 等
出版事項: (2015-09-01) -
Big data in multi-block data analysis: An approach to parallelizing Partial Least Squares Mode B algorithm
著者:: Alba Martinez-Ruiz, 等
出版事項: (2019-04-01) -
From Kleisli Categories to Commutative C*-algebras: Probabilistic Gelfand Duality
著者:: Robert W. J. Furber, 等
出版事項: (2015-06-01)