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


Related posts

Skills for Success with Microsoft Word 2016 Comprehensive (Skills for Success for Office 2016 Series) by Lisa Hawkins, PDF 0134479491
IC3 Certification Guide Using Microsoft Windows 7 & Microsoft Office 2013 by CCI Learning, PDF 1337287970
Python Programming: Become an Expert at Python Today with Step by Step Instructions for Beginners by Nick Goddard, PDF 1533337772
A Survey on Information Security Awareness in Turkey: IS awareness of citizens and technical employees working in IT departments by Ahmet Durmuş, PDF 3659716529
Fundamentals of Soft Computing by Anil V. Turukmane, PDF 3330034106
Ethics in Information Technology by George Reynolds, PDF 1337405876

Leave a Reply

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