[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Skip header Section
Artificial intelligence (2nd ed.): structures and strategies for complex problem-solvingMarch 1993
Publisher:
  • Benjamin-Cummings Publishing Co., Inc.
  • Subs. of Addison-Wesley Longman Publ. Co390 Bridge Pkwy. Redwood City, CA
  • United States
ISBN:978-0-8053-4780-7
Published:01 March 1993
Pages:
740
Skip Bibliometrics Section
Reflects downloads up to 24 Dec 2024Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Suárez-Barón M, Velasquez J and Salinas-Valencia K Towards semistructured information integrating using XML and deductive logic Proceedings of the sixth international conference on Knowledge capture, (181-182)
  2. Turner C, Bishay H, Bastien G, Peng B and Phillips R (2007). Configuring policies in public health applications, Expert Systems with Applications: An International Journal, 32:4, (1059-1072), Online publication date: 1-May-2007.
  3. ACM
    Beaubouef T (2003). Why computer science students need language, ACM SIGCSE Bulletin, 35:4, (51-54), Online publication date: 1-Dec-2003.
  4. ACM
    Beaubouef T (2002). Why computer science students need math, ACM SIGCSE Bulletin, 34:4, (57-59), Online publication date: 1-Dec-2002.
  5. ACM
    Obreiter P and Gräf G Towards scalability in tuple spaces Proceedings of the 2002 ACM symposium on Applied computing, (344-350)
  6. ACM
    Ng'ambi D Dynamic "intelligent handler" of frequently asked questions Proceedings of the 7th international conference on Intelligent user interfaces, (210-211)
  7. Mora M, Cervantes-Pérez F, Gelman-Muravchik O, Forgionne G, Mejía-Olvera M and Weitzenfeld-Reitel A DMSS implementation research Decision making support systems, (331-356)
  8. ACM
    Sutherland K (1999). Book reviews, intelligence, 10:4, (27-41), Online publication date: 1-Dec-1999.
  9. ACM
    Embley D, Jiang Y and Ng Y Record-boundary discovery in Web documents Proceedings of the 1999 ACM SIGMOD international conference on Management of data, (467-478)
  10. ACM
    Embley D, Jiang Y and Ng Y (1999). Record-boundary discovery in Web documents, ACM SIGMOD Record, 28:2, (467-478), Online publication date: 1-Jun-1999.
  11. ACM
    Cordova J Mathematical proofs as graph search problems in theory courses The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, (110-113)
  12. ACM
    Cordova J (1999). Mathematical proofs as graph search problems in theory courses, ACM SIGCSE Bulletin, 31:1, (110-113), Online publication date: 1-Mar-1999.
  13. Bennett J (1996). Ferranti Recollections (1950-1955), IEEE Annals of the History of Computing, 18:3, (63-66), Online publication date: 1-Oct-1996.
  14. ACM
    Thomas S (1995). A consideration of some approaches to course organization, ACM SIGART Bulletin, 6:2, (27-28), Online publication date: 1-Apr-1995.
Contributors
  • The University of New Mexico
  • Sandia National Laboratories

Reviews

Dario A. Giuse

Once in a while, a book comes along on a topic that has been discussed ad infinitum and yet manages to convey a sense of freshness and new interest. This is one such book. Although the book does not contain any revolutionary new view of artificial intelligence, it presents the material under a new, interesting light and gives a unified view of the field. Whereas other books on AI read like laundry lists of different and unrelated techniques, the authors manage to keep the reader's attention through 700 pages, and provide a rich web of connections between different areas and topics. One reason for the success of the book is the clear effort to find and analyze the true innovations in the different areas of AI. Rather than relying on what everybody knows, Luger and Stubblefield have actually tried to go back to the real beginnings, and give descriptions of the pioneering works in each field that are both detailed and compelling. All the chapters are well written and balanced; the only one I did not like is chapter 7, the introduction to LISP, which takes an old-fashioned approach to the language and ignores its more modern features. These problems are corrected in later chapters about LISP. The presentation of Prolog, by contrast, is extremely lucid and quite interesting, and avoids unnecessary details that would obscure the central issues. The book covers many of the topics one would expect from a work on AI: formal logic (chapter 2); representation and search (chapters 3 through 5); AI languages (chapters 6, 7, and 13 through 15); and knowledge-based systems, knowledge representation, natural language processing, and machine learning (chapters 8 through 12). Several topics are omitted that are typically discussed in similar works, such as machine vision or speech understanding. Such omissions, however, are not a disadvantage; in fact, they may help avoid the typical laundry list impression. In addition to clear pseudocode descriptions, LISP and Prolog implementations are given for the main algorithms. The emphases on graph theory as a tool to represent search spaces, on logic as a tool to represent knowledge, and on embedded languages as a problem-solving technique act as unifying themes through the book. The primary emphasis of the book is on the symbol processing view of AI; subsymbolic theories are also explained clearly, however, and the differences between the two schools of thought are explained well. The philosophical roots of AI are usually covered in a perfunctory way. In this work, however, the authors go beyond the usual and show the gradual evolution of ideas from metaphysics and logic into modern-day AI research; in addition, they keep bringing up the central themes (the connections to logic, and AI as a model of human intelligence as well as a useful applied technology) throughout the book, giving the overall impression of unity I have mentioned. The book can be used as a classroom textbook for one- and two-semester courses on AI. An instructor's manual and a disk with all the programming examples are available separately from the publisher. Each chapter comes with a rich assortment of exercises, some of which could be full-scale projects (the exercises are not graded for difficulty). The bibliography is extensive; even better, most of the references are discussed briefly in the text, and the pioneering contributions are pointed out clearly and effectively. The typesetting is excellent, with virtually no typos. The index is also good. I enjoyed reading this book, which is something I cannot say of all the AI books I have read recently. It will give readers an excellent understanding of how the main building blocks of artificial intelligence (logic, graph theory, and so on) relate to the discipline, and how the main issues in the field (for example, symbolic versus subsymbolic representation) are playing out. I definitely recommend the book to anybody who wants to learn more about artificial intelligence.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Please enable JavaScript to view thecomments powered by Disqus.

Recommendations