Parallel Algorithms for Free and Associative-commutative Unification - Gaetan J. D. R. Hains - Bøker - LAP LAMBERT Academic Publishing - 9783659639920 - 19. november 2014
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

Parallel Algorithms for Free and Associative-commutative Unification

Pris
NOK 479

Bestillingsvarer

Forventes levert 3. - 11. des
Julegaver kan byttes frem til 31. januar
Få varsel om nye utgivelser fra Gaetan J. D. R. Hains
Legg til iMusic ønskeliste
eller

Ikke vurdert ennå

This 1990 work is written as a guide to the design of fast algorithms for free term matching, free unification and associative-commutative term matching. The goal of this research was to identify tractable unification problems, to evaluate existing methods for their solution and design new ones where appropriate. The emphasis is on speed, as measured by the worst-case complexity of algorithms. Only methods with direct relevance to practical use were chosen, and are presented in the wider context of unification theory. Few assumptions are made about the environment in which unification is to be used. Terms are represented as graphs, the most common data structure in use now. Results presented here should be useful in the implementation of fast symbolic manipulation systems and their application to scalable intelligent software.

Media Bøker     Pocketbok   (Bok med mykt omslag og limt rygg)
Utgitt 19. november 2014
ISBN13 9783659639920
Utgivere LAP LAMBERT Academic Publishing
Antall sider 128
Mål 7 × 150 × 220 mm   ·   209 g
Språk Tysk