Sorry, we just need to make sure you're not a robot. For best results, please make sure your browser is accepting cookies.

"This is a popular interpretation of expert systems - computer models providing artificial intelligence to managers and businessmen - which are transforming business in the 1980s. The book gives an inside view of many international companies such as Canon, Westinghouse, IBM, Du Pont and others." New York: Times Books.

"Knowledge-Based Tutoring describes the advantages and difficulties of adapting an expert system for use in teaching and problem solving. In this case the well-known rule-based expert system, MYCIN, which has been widely used in medical artificial intelligence to do infectious disease diagnosis and therapy selection, is used as a base for the instructional program GUIDON. MYCIN's rules are interpreted by GUIDON in order to evaluate a student's problem solving and provide assistance as the student gathers information about a patient and makes a diagnosis. The book describes what GUIDON does, how it is constructed, and the benefits and limitations of its design."

A classic introduction to artificial intelligence intended to bridge the gap between theory and practice, Principles of Artificial Intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of the control strategies used. Palo Alto, California: Tioga.

Sorry, we just need to make sure you're not a robot. For best results, please make sure your browser is accepting cookies.

"With the objective of making into a science the art of verifying computer programs (debugging), the author addresses both practical and theoretical aspects of the process. A classic of sequential program verification, this volume has been translated into almost a dozen other languages and is much in demand among graduate and advanced undergraduate computer science students. Subjects include computability (with discussions of finite automata and Turing machines); predicate calculus (basic notions, natural deduction, and the resolution method); verification of programs (both flowchart and algol-like programs); flowchart schemas (basic notions, decision problems, formalization in predicate calculus, and translation programs); and the fixpoint theory of programs (functions and functionals, recursive programs, and verification programs). The treatment is self-contained, and each chapter concludes with bibliographic remarks, references, and problems." New York: McGraw-Hill, 1974.