Parallel Algorithms for Free and Associative-Commutative Unification by Gaetan J. D. R. Hains, PDF 3659639923

Parallel Algorithms for Free and Associative-Commutative Unification

  • Title: Parallel Algorithms for Free and Associative-Commutative Unification
  • Autor: Gaetan J. D. R. Hains
  • Publisher (Publication Date): LAP LAMBERT Academic Publishing (November 19, 2014)
  • Language: English
  • ISBN-10: | 3659639923
  • ISBN-13: | 978-3659639920
  • File Format: EPUB, PDF

 
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.

No reviews

Comments:


Related posts

User Experience Mapping: Enhance UX with User Story Map, Journey Map and Diagrams by Peter W. Szabo, PDF 1787123502
The Art of Overwatch by Blizzard, PDF
Swift 4 Protocol-Oriented Programming – Third Edition: Bring predictability, performance, and productivity to your Swift applications by Jon Hoffman, PDF 1788470036
Mastering Django: Core: The Complete Guide to Django 1.8 LTS by Nigel George, PDF 099461683X
Inside C by Giuseppe Di Cataldo, PDF 1549995960
Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming by Narasimha Karumanchi, PDF

Leave a Reply

Your email address will not be published. Required fields are marked *