Mathematical Methods in Artificial Intelligence (Practitioners) by Edward A. Bender

Mathematical Methods in Artificial Intelligence (Practitioners)

Features

Cover Type: Paperback with 656 pages

Published by: Wiley-IEEE Computer Society Pr

Edition: 1st Edition January 27, 1996

Written in: English

ISBN 10 Number: 0818672005

ISBN 13 Number: 978-0818672002

Book Dimensions: 10.4 x 7.3 x 1.6 inches

Weighs: 2.9 pounds

Product Description
Mathematical Methods in Artificial Intelligence introduces the student to the important mathematical foundations and tools in AI and describes their applications to the design of AI algorithms. This useful text presents an introductory AI course based on the most important mathematics and its applications. It focuses on important topics that are proven useful in AI and involve the most broadly applicable mathematics.

The book explores AI from three different viewpoints: goals, methods or tools, and achievements and failures. Its goals of reasoning, planning, learning, or language understanding and use are centered around the expert system idea. The tools of AI are presented in terms of what can be incorporated in the data structures. The book looks into the concepts and tools of limited structure, mathematical logic, logic-like representation, numerical information, and nonsymbolic structures.

The text emphasizes the main mathematical tools for representing and manipulating knowledge symbolically. These are various forms of logic for qualitative knowledge, and probability and related concepts for quantitative knowledge. The main tools for manipulating knowledge nonsymbolically, as neural nets, are optimization methods and statistics. This material is covered in the text by topics such as trees and search, classical mathematical logic, and uncertainty and reasoning. A solutions diskette is available, please call for more information.

Back Cover Copy
Introduces the students to the important mathematical foundations and tools in AI and describes their application to the design of AI algorithms. The book presents an introductory AI course based on the most important mathematics applications, while focusing on important topics that are proven useful in AI and involve the most broadly applicable mathematics.

The book explores AI from three different viewpoints: goals, methods or tools, and achievements and failures. Its goals of reasoning, planning, learning, or language understanding and use are centered around the expert system idea. The tools of AI are presented in terms of what can be incorporated in the data structures. The book looks at the concepts and tools of limited structure, mathematical logic, logic-like representation, numerical information, and nonsymbolic structures.

Many introductory texts give the impression that AI is just a collection of heuristic ideas, data structures, and clever hacks. Fortunately, AI researchers use mathematics and are developing new tools. Since much of the mathematics used in AI is not part of standard undergraduate curriculum, the student will be learning mathematics and seeing how it is used in AI at the same time. A diskette containing solutions to many of the exercises is available for instructors.

Reader Reviews
Although using only elementary mathematics, and not at all addressing new areas of artificial intelligence, such as inductive logic programming, this book gives an excellent overview of how mathematics is used in artificial intelligence. Mathematics at all levels is used in this field, both in the algorithms and in discussing its foundations, and this book serves as a good introduction to its application in A.I. Only elementary algebra and calculus are used in the book, making it very accessible to the beginning student in computer science. Readers with more sophisticated background in mathematics can then extend the results in the book to more advanced mathematical contexts. The author's writing style is very informal, and in many places in the book he encourages the reader to "stop and think" before continuing in the reading. Exercises, some simple and some very challenging, are found at the end of most chapter sections. The author gives a brief overview of the history of A.I. in chapter one, including a discussion of the issues of computational complexity in A.I. algorithms, a discussion of expert systems (with examples), and a few biographical sketches. Chapter 2 is a fairly detailed overview of search algorithms, and the author introduces some notions from the mathematical field of combinatorics, namely directed graphs and ordered trees. Induction and recursion are then reviewed as tools for search algorithms. The recursive formulation of algorithms in A.I. is of course very powerful, and one that students need to master early on. Fields such as bioinformatics and data mining are becoming increasingly dependent on search algorithms from A.I., and the author reviews these in detail, including 'simple' search methods such as breadth-first, depth-first, and iterative-deepening, along with 'heuristic' methods. The reader gets introduced to first-order predicate calculus in chapter 3. This topic could be said to be one of the most important ones in A.I., and it is discussed in this chapter using the (declarative) programming language Prolog. One could easily use the language Lisp, but Prolog makes more apparent the head/body clause structure of predicate logic. In addition, if a reader wants to move on to more modern developments in A.I., such as inductive logic programming, which can be viewed essentially as predicate logic but with inductive reasoning, a mastery of the content of this chapter is essential. Chapter 4 introduces the reader to the proof theory, namely the technique of resolution, which is discussed for propositional calculus, where it is very simple, and for predicate logic, in the latter wherein some specialized techniques must be brought in, such as Skolemization. The author also discussed proof in the context of Prolog, and introduces the cut operator, which inhibits Prolog from fully implementing resolution. He also gives an interesting discussion on the problem of negation in Prolog and the closed-world assumption. The author has been careful to not write a purely theoretical book in computer science, and evidence of this is given in chapter 5, which discusses how to implement first-order logic (FOL) into real-world applications. It is one thing to discuss the properties of logic, quite another to actually use it productively to solve problems of interest. The author discusses the limitations of FOL in these applications, and how they can be resolved through alternative reasoning tools, such as nonmonotonic logics, Bayesian networks, and fuzzy sets. One of these alternatives, nonmonotonic reasoning, is discussed in the next chapter, wherein the author gives a fairly detailed overview of default reasoning and how it is implemented in Prolog. Rule sets and semantic nets are also discussed, along with defeasible reasoning. Applications of these techniques are stymied by their computational complexity, and the author gives references for discussions of this. After a review of probability theory in chapter 7, the author discusses Bayesian networks in chapter 8. These have been extremely important in recent applications of A.I., and the author gives a fine review of their properties, especially their ability to incorporate causality by imposing a directed graph structure on the event space. The author gives a few examples of Bayesian networks, including a medical diagnosis, wherein he introduces a very important concept in A.I., namely that of abductive inference. Detailed discussion (with proofs) is given for the Kim-Pearl algorithm for singly connected networks. Chapter 9 is an introduction to fuzzy logic and belief theory. The author motivates nicely the reasons for considering fuzzy reasoning instead of probabilistic methods. The Dempster-Shafer belief theory, which has become popular in recent years, is also discussed in some detail. So as to motivate the discussion of neural networks, the next chapter overviews automatic pattern classification. Contrasting between supervised and unsupervised learning of patterns, the author then outlines the types of automatic classifiers, such as decision trees and neural networks. The chapter on neural networks is a good introduction considering the vastness of the subject. Indeed, an enormous amount of research has been done on neural networks, and their use in applications of A.I. has finally been achieving success in recent years. Concepts from information theory are of course very important in A.I. and these are discussed in chapter 12, along with more advanced topics in probability and statistics that were not treated earlier in the book. These ideas are used in the next chapter wherein neural networks and decisions trees are discussed in more detail. The most interesting part of this discussion is the idea that noise can improve the generalization capabilities of neural networks. This strategy will be obvious to the physicist reader who has studied the effects of noise on dynamical systems governed by potentials with local minima. The last chapter of the book discusses some additional topics that should be included in a study of A.I., such as genetic algorithms and more discussion of optimization, such as simulated annealing. Hidden Markov models are also briefly discussed, and this is somewhat disappointing given their importance in current applications. The reader is also introduced to robotics, certainly the most exciting of all topics in 21st century A.I. Comment | | (Report this)

List Price: $72.50
Available from Amazon
Price: $46.40
Updated on 6-4-2008.