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...
1. autor: | Hains, G |
---|---|
Kolejni autorzy: | McColl, B |
Format: | Praca dyplomowa |
Język: | English |
Wydane: |
1989
|
Hasła przedmiotowe: |
Podobne zapisy
-
On the commutativity of the powerspace constructions
od: Matthew de Brecht, i wsp.
Wydane: (2019-08-01) -
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry
od: Andrew M Marshall, i wsp.
Wydane: (2015-06-01) -
Exact Unification and Admissibility
od: George Metcalfe, i wsp.
Wydane: (2015-09-01) -
Big data in multi-block data analysis: An approach to parallelizing Partial Least Squares Mode B algorithm
od: Alba Martinez-Ruiz, i wsp.
Wydane: (2019-04-01) -
From Kleisli Categories to Commutative C*-algebras: Probabilistic Gelfand Duality
od: Robert W. J. Furber, i wsp.
Wydane: (2015-06-01)