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)