CONTENTS PART I ARTIFICIAL INTELLIGENCE: ITS ROOTS AND SCOPE 1

Similar documents
Knowledge-Based - Systems

Module 12. Machine Learning. Version 2 CSE IIT, Kharagpur

Knowledge based expert systems D H A N A N J A Y K A L B A N D E

AQUA: An Ontology-Driven Question Answering System

Objectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition

Guide to Teaching Computer Science

Lecture 1: Basic Concepts of Machine Learning

Python Machine Learning

Rule-based Expert Systems

Laboratorio di Intelligenza Artificiale e Robotica

IAT 888: Metacreation Machines endowed with creative behavior. Philippe Pasquier Office 565 (floor 14)

Courses in English. Application Development Technology. Artificial Intelligence. 2017/18 Spring Semester. Database access

Learning Methods for Fuzzy Systems

ReinForest: Multi-Domain Dialogue Management Using Hierarchical Policies and Knowledge Ontology

Learning and Transferring Relational Instance-Based Policies

Probabilistic Latent Semantic Analysis

CS 598 Natural Language Processing

Some Principles of Automated Natural Language Information Extraction

The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X

Lecture 1: Machine Learning Basics

POLA: a student modeling framework for Probabilistic On-Line Assessment of problem solving performance

Laboratorio di Intelligenza Artificiale e Robotica

(Sub)Gradient Descent

COMPUTER SCIENCE GRADUATE STUDIES Course Descriptions by Methodology

COMPUTER SCIENCE GRADUATE STUDIES Course Descriptions by Research Area

A Genetic Irrational Belief System

CSL465/603 - Machine Learning

MASTER OF SCIENCE (M.S.) MAJOR IN COMPUTER SCIENCE

TEACHING AND EXAMINATION REGULATIONS PART B: programme-specific section MASTER S PROGRAMME IN LOGIC

Evolutive Neural Net Fuzzy Filtering: Basic Description

Integrating Meta-Level and Domain-Level Knowledge for Task-Oriented Dialogue

A NEW ALGORITHM FOR GENERATION OF DECISION TREES

Machine Learning from Garden Path Sentences: The Application of Computational Linguistics

Course Outline. Course Grading. Where to go for help. Academic Integrity. EE-589 Introduction to Neural Networks NN 1 EE

Planning with External Events

BENG Simulation Modeling of Biological Systems. BENG 5613 Syllabus: Page 1 of 9. SPECIAL NOTE No. 1:

Integrating E-learning Environments with Computational Intelligence Assessment Agents

Toward Probabilistic Natural Logic for Syllogistic Reasoning

We are strong in research and particularly noted in software engineering, information security and privacy, and humane gaming.

Learning Methods in Multilingual Speech Recognition

INTRODUCTION TO DECISION ANALYSIS (Economics ) Prof. Klaus Nehring Spring Syllabus

Automating the E-learning Personalization

Semi-supervised methods of text processing, and an application to medical concept extraction. Yacine Jernite Text-as-Data series September 17.

Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for

Predicting Future User Actions by Observing Unmodified Applications

Radius STEM Readiness TM

understand a concept, master it through many problem-solving tasks, and apply it in different situations. One may have sufficient knowledge about a do

Chapter 2 Rule Learning in a Nutshell

Discriminative Learning of Beam-Search Heuristics for Planning

Neuro-Symbolic Approaches for Knowledge Representation in Expert Systems

A Version Space Approach to Learning Context-free Grammars

Natural Language Processing: Interpretation, Reasoning and Machine Learning

Predicting Student Attrition in MOOCs using Sentiment Analysis and Neural Networks

Natural Language Processing. George Konidaris

arxiv: v1 [cs.cv] 10 May 2017

TD(λ) and Q-Learning Based Ludo Players

Action Models and their Induction

Self Study Report Computer Science

Organizational Knowledge Distribution: An Experimental Evaluation

Evolution of Collective Commitment during Teamwork

Level 6. Higher Education Funding Council for England (HEFCE) Fee for 2017/18 is 9,250*

Proof Theory for Syntacticians

COMPUTER-ASSISTED INDEPENDENT STUDY IN MULTIVARIATE CALCULUS

Seminar - Organic Computing

FUZZY EXPERT. Dr. Kasim M. Al-Aubidy. Philadelphia University. Computer Eng. Dept February 2002 University of Damascus-Syria

Deep search. Enhancing a search bar using machine learning. Ilgün Ilgün & Cedric Reichenbach

A R "! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ;

GRADUATE STUDENT HANDBOOK Master of Science Programs in Biostatistics

For information only, correct responses are listed in the chart below. Question Number. Correct Response

11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation

EGRHS Course Fair. Science & Math AP & IB Courses

Version Space. Term 2012/2013 LSI - FIB. Javier Béjar cbea (LSI - FIB) Version Space Term 2012/ / 18

University of Groningen. Systemen, planning, netwerken Bosman, Aart

Parsing of part-of-speech tagged Assamese Texts

Knowledge Elicitation Tool Classification. Janet E. Burge. Artificial Intelligence Research Group. Worcester Polytechnic Institute

Language Acquisition Fall 2010/Winter Lexical Categories. Afra Alishahi, Heiner Drenhaus

UC Merced Proceedings of the Annual Meeting of the Cognitive Science Society

Reinforcement Learning by Comparing Immediate Reward

Content-free collaborative learning modeling using data mining

Henry Tirri* Petri Myllymgki

An Investigation into Team-Based Planning

An Interactive Intelligent Language Tutor Over The Internet

Compositional Semantics

Axiom 2013 Team Description Paper

Proposal of Pattern Recognition as a necessary and sufficient principle to Cognitive Science

Rule discovery in Web-based educational systems using Grammar-Based Genetic Programming

Intension, Attitude, and Tense Annotation in a High-Fidelity Semantic Representation

Lecture 10: Reinforcement Learning

Evolution of Symbolisation in Chimpanzees and Neural Nets

Software Development: Programming Paradigms (SCQF level 8)

Artificial Neural Networks

Facilitating Students From Inadequacy Concept in Constructing Proof to Formal Proof

Ph.D in Advance Machine Learning (computer science) PhD submitted, degree to be awarded on convocation, sept B.Tech in Computer science and

Introduction to Simulation

Learning to Schedule Straight-Line Code

Word Segmentation of Off-line Handwritten Documents

Visual CP Representation of Knowledge

An OO Framework for building Intelligence and Learning properties in Software Agents

Bug triage in open source systems: a review

Clouds = Heavy Sidewalk = Wet. davinci V2.1 alpha3

Transcription:

Preface vii Publisher s Acknowledgements xv PART I ARTIFICIAL INTELLIGENCE: ITS ROOTS AND SCOPE 1 1 AI: HISTORY AND APPLICATIONS 3 1.1 From Eden to ENIAC: Attitudes toward Intelligence, Knowledge, and Human Artifice 3 1.2 Overview of AI Application Areas 20 1.3 Artificial Intelligence A Summary 30 1.4 Epilogue and References 31 1.5 Exercises 33 PART II ARTIFICIAL INTELLIGENCE AS REPRESENTATION AND SEARCH 35 2 THE PREDICATE CALCULUS 45 2.0 Introduction 45 2.1 The Propositional Calculus 45 2.2 The Predicate Calculus 50 2.3 Using Inference Rules to Produce Predicate Calculus Expressions 62 2.4 Application: A Logic-Based Financial Advisor 73 2.5 Epilogue and References 77 2.6 Exercises 77 xix

3 STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH 79 3.0 Introduction 79 3.1 Graph Theory 82 3.2 Strategies for State Space Search 93 3.3 Using the State Space to Represent Reasoning with the Predicate Calculus 107 3.4 Epilogue and References 121 3.5 Exercises 121 4 HEURISTIC SEARCH 123 4.0 Introduction 123 4.1 Hill Climbing and Dynamic Programming 127 4.2 The Best-First Search Algorithm 133 4.3 Admissibility, Monotonicity, and Informedness 145 4.4 Using Heuristics in Games 150 4.5 Complexity Issues 157 4.6 Epilogue and References 161 4.7 Exercises 162 5 STOCHASTIC METHODS 165 5.0 Introduction 165 5.1 The Elements of Counting 167 5.2 Elements of Probability Theory 170 5.3 Applications of the Stochastic Methodology 182 5.4 Bayes Theorem 184 5.5 Epilogue and References 190 5.6 Exercises 191 6 CONTROL AND IMPLEMENTATION OF STATE SPACE SEARCH 193 6.0 Introduction 193 6.1 Recursion-Based Search 194 6.2 Production Systems 200 6.3 The Blackboard Architecture for Problem Solving 187 6.4 Epilogue and References 219 6.5 Exercises 220 PART III CAPTURING INTELLIGENCE: THE AI CHALLENGE 223 7 KNOWLEDGE REPRESENTATION 227 7.0 Issues in Knowledge Representation 227 7.1 A Brief History of AI Representational Systems 228 xx

7.2 Conceptual Graphs: A Network Language 248 7.3 Alternative Representations and Ontologies 258 7.4 Agent Based and Distributed Problem Solving 265 7.5 Epilogue and References 270 7.6 Exercises 273 8 STRONG METHOD PROBLEM SOLVING 277 8.0 Introduction 277 8.1 Overview of Expert System Technology 279 8.2 Rule-Based Expert Systems 286 8.3 Model-Based, Case Based, and Hybrid Systems 298 8.4 Planning 314 8.5 Epilogue and References 329 8.6 Exercises 331 9 REASONING IN UNCERTAIN SITUATIONS 333 9.0 Introduction 333 9.1 Logic-Based Abductive Inference 335 9.2 Abduction: Alternatives to Logic 350 9.3 The Stochastic Approach to Uncertainty 363 9.4 Epilogue and References 378 9.5 Exercises 380 PART IV MACHINE LEARNING 385 10 MACHINE LEARNING: SYMBOL-BASED 387 10.0 Introduction 387 10.1 A Framework for Symbol-based Learning 390 10.2 Version Space Search 396 10.3 The ID3 Decision Tree Induction Algorithm 408 10.4 Inductive Bias and Learnability 417 10.5 Knowledge and Learning 422 10.6 Unsupervised Learning 433 10.7 Reinforcement Learning 442 10.8 Epilogue and References 449 10.9 Exercises 450 11 MACHINE LEARNING: CONNECTIONIST 453 11.0 Introduction 453 11.1 Foundations for Connectionist Networks 455 11.2 Perceptron Learning 458 11.3 Backpropagation Learning 467 11.4 Competitive Learning 474 xxi

11.5 Hebbian Coincidence Learning 484 11.6 Attractor Networks or Memories 495 11.7 Epilogue and References 505 11.8 Exercises 506 12 MACHINE LEARNING: GENETIC AND EMERGENT 507 12.0 Genetic and Emergent Models of Learning 507 12.1 The Genetic Algorithm 509 12.2 Classifier Systems and Genetic Programming 519 12.3 Artificial Life and Society-Based Learning 530 12.4 Epilogue and References 541 12.5 Exercises 542 13 MACHINE LEARNING: PROBABILISTIC 543 13.0 Stochastic and Dynamic Models of Learning 543 13.1 Hidden Markov Models (HMMs) 544 13.2 Dynamic Bayesian Networks and Learning 554 13.3 Stochastic Extensions to Reinforcement Learning 564 13.4 Epilogue and References 568 13.5 Exercises 570 PART V ADVANCED TOPICS FOR AI PROBLEM SOLVING 573 14 AUTOMATED REASONING 575 14.0 Introduction to Weak Methods in Theorem Proving 575 14.1 The General Problem Solver and Difference Tables 576 14.2 Resolution Theorem Proving 582 14.3 PROLOG and Automated Reasoning 603 14.4 Further Issues in Automated Reasoning 609 14.5 Epilogue and References 666 14.6 Exercises 667 15 UNDERSTANDING NATURAL LANGUAGE 619 15.0 The Natural Language Understanding Problem 619 15.1 Deconstructing Language: An Analysis 622 15.2 Syntax 625 15.3 Transition Network Parsers and Semantics 633 15.4 Stochastic Tools for Language Understanding 649 15.5 Natural Language Applications 658 15.6 Epilogue and References 630 15.7 Exercises 632 xxii

PART VI EPILOGUE 671 16 ARTIFICIAL INTELLIGENCE AS EMPIRICAL ENQUIRY 673 16.0 Introduction 673 16.1 Artificial Intelligence: A Revised Definition 675 16.2 The Science of Intelligent Systems 688 16.3 AI: Current Challanges and Future Direstions 698 16.4 Epilogue and References 703 Bibliography 705 Author Index 735 Subject Index 743 xxiii