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...
Autor principal: | Hains, G |
---|---|
Altres autors: | McColl, B |
Format: | Thesis |
Idioma: | English |
Publicat: |
1989
|
Matèries: |
Ítems similars
-
On the commutativity of the powerspace constructions
per: Matthew de Brecht, et al.
Publicat: (2019-08-01) -
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry
per: Andrew M Marshall, et al.
Publicat: (2015-06-01) -
Exact Unification and Admissibility
per: George Metcalfe, et al.
Publicat: (2015-09-01) -
Big data in multi-block data analysis: An approach to parallelizing Partial Least Squares Mode B algorithm
per: Alba Martinez-Ruiz, et al.
Publicat: (2019-04-01) -
From Kleisli Categories to Commutative C*-algebras: Probabilistic Gelfand Duality
per: Robert W. J. Furber, et al.
Publicat: (2015-06-01)