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...
Autore principale: | Hains, G |
---|---|
Altri autori: | McColl, B |
Natura: | Tesi |
Lingua: | English |
Pubblicazione: |
1989
|
Soggetti: |
Documenti analoghi
Documenti analoghi
-
On the commutativity of the powerspace constructions
di: Matthew de Brecht, et al.
Pubblicazione: (2019-08-01) -
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry
di: Andrew M Marshall, et al.
Pubblicazione: (2015-06-01) -
Exact Unification and Admissibility
di: George Metcalfe, et al.
Pubblicazione: (2015-09-01) -
Big data in multi-block data analysis: An approach to parallelizing Partial Least Squares Mode B algorithm
di: Alba Martinez-Ruiz, et al.
Pubblicazione: (2019-04-01) -
From Kleisli Categories to Commutative C*-algebras: Probabilistic Gelfand Duality
di: Robert W. J. Furber, et al.
Pubblicazione: (2015-06-01)