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

Boost.Asio C++ Network Programming – Second Edition by Wisnu Anggoro, PDF 1785283073
Tom Clancys Ghost Recon Wildlands Game Guide Unofficial by The Yuw, PDF 1548400459
An adaptive Framework for run-time Group-based Communication by Paul Okanda, PDF 3659789291
AI Injected e-Learning: The Future of Online Education (Studies in Computational Intelligence) by Matthew Montebello, PDF
Exam Ref 70-743 Upgrading Your Skills to MCSA: Windows Server 2016 by Charles Pluta, PDF 0735697434
CCSP (ISC)2 Certified Cloud Security Professional Official Study Guide by Ben Malisow, PDF 1119277418

Leave a Reply

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