Talk:Artificial intelligence/Textbook survey

This is a survey of major AI textbooks and a few academic course listings, designed to determine for Wikipedia what topics are essential to an introduction to artificial intelligence. This is intended to help the central articles about artificial intelligence to pass the featured article criteria. It should be noted that there is a great deal of consensus among experts on what subjects constitute the whole field of AI research.

Textbooks

These are listed on the [http://aima.cs.berkeley.edu/books.html list of textbooks at AI Topics], which also lists their relative popularity. These are the four most popular textbooks published since 1998 (i.e. in the ten years before this survey was done.)

= Russell & Norvig (standard AI textbook) =

{{Russell Norvig 2003}}

Chapters:

  • 1 Introduction History of AI, some philosophy of AI
  • 2 Intelligent agent paradigm
  • 3-6 Search
  • 7-9 Logic
  • 10 Knowledge representation
  • 11-12 Planning
  • 13-17 Uncertain reasoning
  • 18-21 Learning
  • 22-23 Natural language processing (they call "communication")
  • 24 Perception
  • 25 Robotics
  • 26 Philosophy of AI
  • 27 future of AI

= Nilsson =

{{Citation|last=Nilsson|first=Nils|author-link=Nils Nilsson|year=1998|title=Artificial Intelligence: A New Synthesis|publisher=Morgan Kaufmann Publishers|isbn=978-1-55860-467-4}}

:1 Introduction

I Reactive Machines

:2 Stimulus-Response Agents

:3 Neural Networks

:4 Machine Evolution

:5 State Machines

:6 Robot Vision

II Search in State Spaces

:7-9 search, uninformed, heuristic

:10 Planning, Acting, and Learning chapter is actually mostly about search, I think...

:11 Alternative Search Formulations and Applications

:12 Adversarial Search

III Knowledge Representation and Reasoning

:13-16 The Propositional, Predicate Calculus and resolution

:17 Knowledge-Based Systems

:18 Representing Commonsense Knowledge

:19 Reasoning with Uncertain Information

:20 Learning and Acting with Bayes Nets

IV Planning Method Based on Logic

:21 The Situation Calculus

:22 Planning

V Communication and Integration

:23 Multiple Agents

:24 Communication Among Agents Natural Language Processing

:25 Agent Architectures

= Luger & Stubblefield =

  • {{Citation|first=George|last= Luger |first2=William|last2= Stubblefield|year=2004|title=Artificial Intelligence: Structures and Strategies for Complex Problem Solving|edition=5th|publisher=The Benjamin/Cummings Publishing Company, Inc.|pages= 720|isbn=0-8053-4780-1|url=http://www.cs.unm.edu/~luger/ai-final/tocfull.html}}
  • 1 ARTIFICIAL INTELLIGENCE: ITS ROOTS AND SCOPE 1
  • 2 THE PREDICATE CALCULUS 45
  • 3-4 STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH 79 (including Hill Climbing and Dynamic Programming)
  • 5 STOCHASTIC METHODS 165
  • 6 CONTROL AND IMPLEMENTATION OF STATE SPACE SEARCH 193
  • 7 KNOWLEDGE REPRESENTATION 227
  • 8 STRONG METHOD PROBLEM SOLVING (Expert systems) 277
  • 9 REASONING IN UNCERTAIN SITUATIONS 333
  • 10-12 MACHINE LEARNING: SYMBOL-BASED 387 / CONNECTIONIST 453 / SOCIAL AND EMERGENT 507 (including: Genetic, classifier, artificial life)
  • 13 AUTOMATED REASONING 547
  • 14 UNDERSTANDING NATURAL LANGUAGE 591
  • 15 PROLOG 636
  • 16 AN INTRODUCTION TO LISP 723
  • 17 ARTIFICIAL INTELLIGENCE AS EMPIRICAL ENQUIRY 823

= Poole & Macworth =

{{Citation | first = David | last = Poole | first2 = Alan | last2 = Mackworth | first3 = Randy | last3 = Goebel | publisher = Oxford University Press | publisher-place = New York | year = 1998 | title = Computational Intelligence: A Logical Approach | url = http://www.cs.ubc.ca/spider/poole/ci.html | author-link=David Poole }}

  • Chapter 1 Computational Intelligence and Knowledge introduction
  • Chapter 2 A Representation and Reasoning System forward and backward chaining
  • Chapter 3 Using Definite Knowledge ''includes databases and natural language
  • Chapter 4 Searching includes standard state space searches, dynamic programming, constraint satisfation, hill climbing, "randomization algortihms" and genetic algorithms
  • Chapter 5 Representing Knowledge
  • Chapter 6 Knowledge Engineering,
  • Chapter 7 Beyond Definite Knowledge includes first order logic, proof systems
  • Chapter 8 Actions and Planning
  • Chapter 9 Assumption-Based Reasoning, default reasoning, abduction
  • Chapter 10 Using Uncertain Knowledge
  • Chapter 11 Learning
  • Chapter 12 Building Situated Robots

Other textbooks

= Rich & Knight =

{{Citation|first= Elaine|last= Rich|first2=Kevin |laast2=Knight|title=Artificial Intelligence|edition=2nd|publisher=McGraw-Hill|location= New York|year=1991|isbn= 0-07-052263-4|url=http://greta.cs.ioc.ee/yik/lib/22/Rich1.html}}

  • What is Artificial Intelligence?
  • Problems, Problem Spaces, and Search. Heuristic Search Techniques.
  • Knowledge Representation. Knowledge Representation Issues.
  • Using Predicate Logic. Representing Knowledge Using Rules.
  • Symbolic Reasoning Under Uncertainty. Statistical Reasoning.
  • Weak Slot-and-Filler Structures. Strong Slot-and-Filler Structures. Knowledge Representation Summary.
  • Game Playing.
  • Planning.
  • Understanding.
  • Natural Language Processing.
  • Parallel and Distributed AI.
  • Learning.
  • Connectionist Models.
  • Common Sense.
  • Expert Systems.
  • Perception and Action.
  • Conclusion.

= Cawsey =

{{Citation|last=Cawsey|first=Alison|year=1998|title=Essence of Artificial Intelligence|publisher=Prentice Hall|url=http://www.cee.hw.ac.uk/%7Ealison/essence.html|isbn=0135717795}}

  • Introduction.
  • Knowledge Representation and Inference.
  • Expert Systems.
  • Using Search in Problem Solving.
  • Natural Language Processing.
  • Vision.
  • Machine Learning and Neural Networks.
  • Agents and Robots.

= Murray =

{{Citation|last=Murray|first=Arthur|year=2002|title=AI4U|publisher=iUniverse|isbn=0595259227}}

  • Introduction.
  • 1-34 Modules of the AI Mind; Exercises.
  • JavaScript source code of the tutorial AI Mind.

=Poole and Mackworth (2010)=

Artificial Intelligence: Foundations of Computational Agents

:I Agents in the World: What Are Agents and How Can They Be Built?

::1 Artificial Intelligence and Agents

::2 Agent Architectures and Hierarchical Control

:II Representing and Reasoning

::3 States and Searching

::4 Features and Constraints

::5 Propositions and Inference

::6 Reasoning Under Uncertainty

:III Learning and Planning

::7 Learning: Overview and Supervised Learning

::8 Planning with Certainty

::9 Planning Under Uncertainty

::10 Multiagent Systems

::11 Beyond Supervised Learning

:IV Reasoning About Individuals and Relations

::12 Individuals and Relations

::13 Ontologies and Knowledge-Based Systems

::14 Relational Planning, Learning, and Probabilistic Reasoning

:V The Big Picture

::15 Retrospect and Prospect

=Cambridge Handbook of Artificial Intelligence (2014)=

:Part I: Foundations

::1. History, motivations, and core themes

::2. Philosophical foundations

::3. Philosophical challenges

:Part II: Architectures

::4. GOFAI

::5. Connectionism and neural networks

::6. Dynamical systems and embedded cognition

:Part III: Dimensions

::7. Learning

::8. Perception and computer vision

::9. Reasoning and decision making

::10. Language and communication

::11. Actions and agents

::12. Artificial emotions and machine consciousness

:Part IV: Extensions

::13. Robotics

::14. Artificial life

::15. The ethics of artificial intelligence

ACM classification

{{Citation|last=ACM|first=(Association of Computing Machinery) |year=1998|title=ACM Computing Classification System: Artificial intelligence|url=http://www.acm.org/class/1998/I.2.html |author-link=Association of Computing Machinery}}

  • I.2.0 General
  • I.2.1 Applications and Expert Systems (H.4, J) considered in this in the section "Applications"
  • I.2.2 Automatic Programming (D.1.2, F.3.1, F.4.1) not considered AI by wikipedia
  • I.2.3 Deduction and Theorem Proving (F.4.1)
  • I.2.4 Knowledge Representation Formalisms and Methods (F.4.1)
  • I.2.5 Programming Languages and Software (D.3.2)
  • I.2.6 Learning (K.3.2)
  • I.2.7 Natural Language Processing
  • I.2.8 Problem Solving, Control Methods, and Search (F.2.2) control theory, dynamic programming, search, planning & scheduling
  • I.2.9 Robotics
  • I.2.10 Vision and Scene Understanding (I.4.8, I.5)
  • I.2.11 Distributed Artificial Intelligence

Websites

= Sloman =

{{Citation|last=Sloman|first=Aaron|year=2007|title=Artificial intelligence: an illustrative overview|url=http://www.cs.bham.ac.uk/%7Eaxs/courses.ai.html|publisher=University of Birmingham}}

  • Perception
  • Natural language processing
  • Learning
  • Planning, problem solving, automatic design
  • Varieties of reasoning
  • Study of representations (knowledge representation)
  • Memory mechanisms and techniques
  • Multi agent systems
  • Affective mechanisms
  • Robotics
  • Architectures for complete systems.
  • Search
  • Ontologies

= Leake =

{{Citation|last=Leake|first=David B.|year=2002|contribution=Artificial intelligence|title=Van Nostrand Scientific Encyclopedia|edition=ninth|publisher=Wiley|location=New York|url=http://www.cs.indiana.edu/%7Eleake/papers/p-01-07/p-01-07.html}}

  • Knowledge capture, representation and reasoning
  • Reasoning under uncertainty
  • Planning, Vision, and Robotics
  • Natural language processing
  • Machine Learning

Bringing it all together

This table lists (just about) every topic that appears in the title of a section or in a chapter summary of {{Harvtxt|Russell|Norvig|2003}}, the most popular AI textbook. Information for the other textbooks is based on their tables of contents, available online. Several topics appear more than once, in different contexts.

class="wikitable"

! style="width:50px" | Subject

style="width:50px" |style="width:50px" |style="width:250px" |{{Harvnb|ACM|1998}}{{Harvnb|Russell|Norvig|2003}}{{Harvnb|Poole|Mackworth|Goebel|1998}}{{Harvnb|Luger|Stubblefield|2004}}{{Harvnb|Nilsson|1998}}
colspan=4 | Defining AI and philosophy of AI

{{Harvnb|ACM|1998|loc=I.2.0}},

{{Harvnb|Russell|Norvig|2003|pp=1-5, 947-967}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=1-6}},

{{Harvnb|Luger|Stubblefield|2004|pp=1-2, 30, ~823-848}},

{{Harvnb|Nilsson|1998|loc=~chpt. 1.1}}

I.2.0pp. 1-5, 947-967pp. 1-6pp. 1-2, 30, ~823-848Contained in this section, but not referred to in the title of the section by name.~chpt. 1.1
colspan=4 | History of AI

{{Harvnb|Russell|Norvig|2003|pp=5-28}},

{{Harvnb|Luger|Stubblefield|2004|pp=3-30}},

{{Harvnb|Nilsson|1998|loc=chpt. 1.3}}

pp. 5-28pp. 3-30chpt. 1.3
colspan=4 | Approaches to AI

{{Harvnb|Nilsson|1998|loc=chpt. 1.2}}

chpt. 1.2
colspan=4 | Future of AI

{{Harvnb|Russell|Norvig|2003|pp=968-974}},

{{Harvnb|Luger|Stubblefield|2004|pp=848-853}}

pp. 968-974pp. 848-853
colspan=4 | Intelligent agent paradigm

{{Harvnb|Russell|Norvig|2003|pp=32-58, 968-972}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=7-21}},

{{Harvnb|Luger|Stubblefield|2004|pp=235-240}}

pp. 32-58, 968-972pp. 7-21pp. 235-240
|

|colspan=3 | Agent architecture)

{{Harvnb|ACM|1998|loc=I.2.11}},

{{Harvnb|Nilsson|1998|loc=chpt. 25}}

I.2.11pp. 27, 932, 970-972chpt. 25
colspan=4 | Search

{{Harvnb|ACM|1998|loc=~I.2.8}},

{{Harvnb|Russell|Norvig|2003|pp=59-189}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=113-163}},

{{Harvnb|Luger|Stubblefield|2004|pp=pp. 79-164, 193-219}},

{{Harvnb|Nilsson|1998|loc=chpt. 7-12}}

~I.2.8pp. 59-189pp. 113-163pp. 79-164, 193-219chpt. 7-12
|

|colspan=3 | Standard searches (breadth first, depth first, backtracking, state space, graph, etc.)

{{Harvnb|Russell|Norvig|2003|pp=59-93}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=113-132}},

{{Harvnb|Luger|Stubblefield|2004|pp=79-121}},

{{Harvnb|Nilsson|1998|loc=chpt. 8}}

pp. 59-93pp. 113-132pp. 79-121chpt. 8
|

|colspan=3 | Informed Heuristic searches (greedy best first, A*, dynamic programming, etc.)

{{Harvnb|Russell|Norvig|2003|pp=94-109}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=132-147}},

{{Harvnb|Luger|Stubblefield|2004|pp=133-150}},

{{Harvnb|Nilsson|1998|loc=chpt. 9}}

pp. 94-109pp. 132-147pp. 133-150chpt. 9
|

|colspan=3 | Local search and optimization searches (hill climbing, simulated annealing, beam search, continuous search (i.e. Hessian matrix searches)), exploratory search ("online search" and random walk searches)

{{Harvnb|Russell|Norvig|2003|pp=110-116,120-129}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=56-163}},

{{Harvnb|Luger|Stubblefield|2004|pp=~127-133}}

pp. 110-116,120-129pp. 56-163Poole discusses local searches under the topic of constraint satisfaction.pp. ~127-133
||colspan=2 | Genetic algorithms

{{Harvnb|Russell|Norvig|2003|pp=pp. 116-119}},

{{Harvnb|Poole|Mackworth|Goebel|1998|p=162}},

{{Harvnb|Luger|Stubblefield|2004|pp=509-530}},

{{Harvnb|Nilsson|1998|loc=chpt. 4.2}}

pp. 116-119pp. 162pp. 509-530chpt. 4.2
|

|colspan=3 | Constraint satisfaction

{{Harvnb|Russell|Norvig|2003|pp=137-156}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=147-163}}

pp. 137-156pp. 147-163
|

|colspan=3 | Adversarial search (minimax, alpha-beta pruning, using utility)

{{Harvnb|Russell|Norvig|2003|pp=161-185}},

{{Harvnb|Luger|Stubblefield|2004|pp=150-157}}

chpt. 12

pp. 161-185pp. 150-157chpt. 12
colspan=4 | Logic{{Harvnb|ACM|1998|loc=~I.2.3}},

{{Harvnb|Russell|Norvig|2003|pp=194-310}},

{{Harvnb|Luger|Stubblefield|2004|pp=35-77}},

{{Harvnb|Nilsson|1998|loc=chpt. 13-16}}

~I.2.3pp. 194-310variouspp. 35-77chpt. 13-16
|

|colspan=3 | Propositional logic

{{Harvnb|Russell|Norvig|2003|pp=204-233}},

{{Harvnb|Luger|Stubblefield|2004|pp=45-50}}

{{Harvnb|Nilsson|1998|loc=chpt. 13}}

pp. 204-233variouspp. 45-50chpt. 13
|

|colspan=3 | First order logic (incl. equality)

{{Harvnb|ACM|1998|loc=~I.2.4}},

{{Harvnb|Russell|Norvig|2003|pp=240-310}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=268-275}},

{{Harvnb|Luger|Stubblefield|2004|pp=50-62}},

{{Harvnb|Nilsson|1998|loc=chpt. 15}}

~I.2.4pp. 240-310pp. 268-275pp. 50-62chpt. 15
|

|colspan=3 | Inference (and inference engine, production system, logic programming)

{{Harvnb|Russell|Norvig|2003|pp=213-224, 272-310}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=46-58}},

{{Harvnb|Luger|Stubblefield|2004|pp=62-73, 194-219, 547-589}},

{{Harvnb|Nilsson|1998|loc=chpt. 14 & 16}}

pp. 213-224, 272-310pp. 46-58pp. 62-73, 194-219, 547-589chpt. 14 & 16
||colspan=2 | Resolution and unification

{{Harvnb|Russell|Norvig|2003|pp=213-217, 275-280, 295-306}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=56-58}},

{{Harvnb|Luger|Stubblefield|2004|pp=554-575}},

{{Harvnb|Nilsson|1998|loc=chpt. 14 & 16}}

pp. 213-217, 275-280, 295-306pp. 56-58pp. 554-575chpt. 14 & 16
||colspan=2 | Forward and backward chaining (also Horn clause): a form of search

{{Harvnb|Russell|Norvig|2003|pp=217-225, 280-294}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=~46-52}},

{{Harvnb|Nilsson|1998|loc=~chpt. 17.2}}

pp. 217-225, 280-294pp. ~46-52~chpt. 17.2
|

|colspan=3| Theorem provers

{{Harvnb|Russell|Norvig|2003|pp=306-310}}

pp. 306-310
|

|colspan=3 | Truth maintenance systems

{{Harvnb|Russell|Norvig|2003|pp=360-362}}

pp. 360-362
colspan=4 | Knowledge representation

{{Harvnb|ACM|1998|loc=I.2.4}},

{{Harvnb|Russell|Norvig|2003|pp=320-363}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=23-46, 69-81, 169-196, 235-277, 281-298, 319-345}}

{{Harvnb|Luger|Stubblefield|2004|pp=227-243}},

{{Harvnb|Nilsson|1998|loc=chpt. 18}}

I.2.4pp. 320-363pp. 23-46, 69-81, 169-196, 235-277, 281-298, 319-345pp. 227-243chpt. 18
|

|colspan=3 | Ontology

{{Harvnb|Russell|Norvig|2003|pp=320-328}}

pp. 320-328
|

|colspan=3 | Representing events and time: Situation calculus, event calculus, fluent calculus (including solving the frame problem)

{{Harvnb|Russell|Norvig|2003|pp=328-341}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=281-298}},

{{Harvnb|Nilsson|1998|loc=chpt. 18.2}}

pp. 328-341pp. 281-298chpt. 18.2
|

|colspan=3 | Representing knowledge about knowlege: Belief calculus, modal logics

{{Harvnb|Russell|Norvig|2003|pp=341-344}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=275-277}}

pp. 341-344pp. 275-277
|

|colspan=3 | Representing categories and relations: Semantic networks, description logics, inheritance, (including the deprecatedAccording to Russell and Norvig. concept of frames and scripts)

{{Harvnb|Russell|Norvig|2003|pp=349-354}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=174-177}},

{{Harvnb|Luger|Stubblefield|2004|pp=248-258}},

{{Harvnb|Nilsson|1998|loc=chpt. 18.3}}

pp. 349-354pp. 174-177pp. 248-258chpt. 18.3
|

|colspan=3 | Default reasoning and default logic, non-monotonic logics, circumscription, closed world assumption, abductionPoole et al. places abduction under "default reasoning". Luger et. al. places this under "uncertain reasoning"

{{Harvnb|Russell|Norvig|2003|pp=354-360}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=248-256, 323-335}}

{{Harvnb|Luger|Stubblefield|2004|pp=335-363}},

{{Harvnb|Nilsson|1998|loc=~18.3.3}}

pp. 354-360pp. 248-256, 323-335pp. 335-363~chpt. 18.3.3
|

|colspan=3 | Causal calculus

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=335-337}}

pp. 335-337
colspan=4 | Knowledge engineering

{{Harvnb|Russell|Norvig|2003|pp=260-266}},

{{Harvnb|Poole|Macworth|Goebel|1998|pp=199-233}},

{{Harvnb|Nilsson|1998|loc=chpt. ~17.1-17.4}}

pp. 260-266pp. 199-233~chpt. 17.1-17.4
|

|colspan=3 | Knowledge acquisition: getting information from experts.

{{Harvnb|Russell|Norvig|2003|p=260}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=212-217}}

pp. 260pp. 212-217
|

|colspan=3 | Explanation

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=217-220}}

pp. 217-220
colspan=4 | Planning

{{Harvnb|ACM|1998|loc=~I.2.8}},

{{Harvnb|Russell|Norvig|2003|pp= 375-459}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=281-316}},

{{Harvnb|Luger|Stubblefield|2004|pp=314-329}},

{{Harvnb|Nilsson|1998|loc=chpt. 10 & 21}}

~I.2.8pp. 375-459pp. 281-316pp. 314-329chpt. 10 & 21
|

|colspan=3 | State space search and planning

{{Harvnb|Russell|Norvig|2003|pp=382-387}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=298-305}},

{{Harvnb|Nilsson|1998|loc=chpt. 10}}

pp. 382-387pp. 298-305chpt. 10
|

|colspan=3 | Partial order planning

{{Harvnb|Russell|Norvig|2003|pp=387-395}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=309-315}}

pp. 387-395pp. 309-315
|

|colspan=3 | Graph planning

{{Harvnb|Russell|Norvig|2003|pp= 395-402}}

pp. 395-402
|

|colspan=3 | Planning with propositional logic (satplan)

{{Harvnb|Russell|Norvig|2003|pp=402-407}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=300-301}},

{{Harvnb|Nilsson|1998|loc=chpt. 21}}

pp. 402-407pp. 300-301chpt. 21
|

|colspan=3 | Hierarchical task network

{{Harvnb|Russell|Norvig|2003|pp=422-430}}

pp. 422-430
|

|colspan=3 | Planning and acting in non-deterministic domains, conditional planning; search in the space of belief states, execution monitoring, replanning and continuous planning.

{{Harvnb|Russell|Norvig|2003|pp=430-449}}

pp. 430-449
|

|colspan=3 | Multi-agent planning

{{Harvnb|Russell|Norvig|2003|pp=449-455}}

pp. 449-455
colspan=4 | Stochastic tools and uncertain reasoning.

{{Harvnb|ACM|1998|loc=~I.2.3}},

{{Harvnb|Russell|Norvig|2003|pp=462-644}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=345-395}},

{{Harvnb|Luger|Stubblefield|2004|pp=165-191, 333-381}},

{{Harvnb|Nilsson|1998|loc=chpt. 19}}

~I.2.3pp. 462-644pp. 345-395pp. 165-191, 333-381chpt. 19
|

|colspan=3 | Probability

{{Harvnb|Russell|Norvig|2003|pp=462-489}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=346-366}},

{{Harvnb|Luger|Stubblefield|2004|pp=~165-182}},

{{Harvnb|Nilsson|1998|loc=chpt. 19.1}}

pp. 462-489pp. 346-366pp. ~165-182chpt. 19.1
|

|colspan=3 | Bayesian networks

{{Harvnb|Russell|Norvig|2003|pp=492-523}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=361-381}},

{{Harvnb|Luger|Stubblefield|2004|pp=~182-190, ~363-379}},

{{Harvnb|Nilsson|1998|loc=chpt. 19.3-4}}

pp. 492-523pp. 361-381pp. ~182-190, ~363-379chpt. 19.3-4, 19.7
||colspan=2 | Bayesian inference

{{Harvnb|Russell|Norvig|2003|pp=504-519}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=361-381}},

{{Harvnb|Luger|Stubblefield|2004|pp=~363-379}},

{{Harvnb|Nilsson|1998|loc=chpt. 19.4}}

pp. 504-519pp. 361-381pp. ~363-379chpt. 19.4
||colspan=2 | Polytrees

{{Harvnb|Nilsson|1998|loc=chpt. 19.7}}

chpt. 19.7
|

|colspan=3| Deprecated methods for uncertain reasoning

{{Harvnb|Russell|Norvig|2003|pp=523-528}}

pp. 523-528
||colspan=2| Certainty factors

{{Harvnb|Russell|Norvig|2003|pp=524-525}}

pp. 524-525
||colspan=2| Dempster-Shafer theory: measuring ignorance

{{Harvnb|Russell|Norvig|2003|pp=525-526}}

pp. 525-526
||colspan=2| Fuzzy logic: degrees of truth

{{Harvnb|Russell|Norvig|2003|pp=526-527}}

pp. 526-527
|

|colspan=3 | Temporal models (Markov property) used for filtering, prediction, smoothing and computing the most likely explanation

{{Harvnb|Russell|Norvig|2003|pp=537-581}}

pp. 537-581
||colspan=2 | Hidden Markov models

{{Harvnb|Russell|Norvig|2003|pp=549-551}}

pp. 549-551
||colspan=2 | Kalman filters

{{Harvnb|Russell|Norvig|2003|pp=551-557}}

pp. 551-557
||colspan=2 | Dynamic Bayesian networks

{{Harvnb|Russell|Norvig|2003|pp=551-557}}

pp. 551-557
|

|colspan=3 | Decision theory or decision analysis (= utility theory + probability theory)

{{Harvnb|Russell|Norvig|2003|pp=584-644}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=381-394}}

pp. 584-604pp. 381-394
||colspan=2 | Bayesian Decision networks

{{Harvnb|Russell|Norvig|2003|pp=597-600}}

pp. 597-600
||colspan=2 | Information value theory

{{Harvnb|Russell|Norvig|2003|pp=600-604}}

pp. 600-604
||colspan=2 | Markov decision processes, and dynamic decision networks

{{Harvnb|Russell|Norvig|2003|pp=613-631}}

pp. 613-631
||colspan=2 | Game theory and its "inverse", mechanism design

{{Harvnb|Russell|Norvig|2003|pp=631-643}}

pp. 631-643
colspan=4 | Learning (supervised (inductive) / unsupervised / reinforcement)

{{Harvnb|ACM|1998|loc=I.2.6}},

{{Harvnb|Russell|Norvig|2003|pp=649-788}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=397-438}},

{{Harvnb|Luger|Stubblefield|2004|pp=385-542}}

{{Harvnb|Nilsson|1998|loc=chpt. 3.3 , 10.3, 17.5, 20}}

I.2.6pp. 649-788pp. 397-438pp. 385-542chpt. 3.3 , 10.3, 17.5, 20
|

|colspan=3 | Symbolic

{{Harvnb|Russell|Norvig|2003|pp=653-736, 763-788}},

{{Harvnb|Luger|Stubblefield|2004|pp=387-450}}

pp. 653-736, 763-788pp. 387-450
||colspan=2 | Decision tree

{{Harvnb|Russell|Norvig|2003|pp=653-664}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=403-408}},

{{Harvnb|Luger|Stubblefield|2004|pp=408-417}}

pp. 653-664pp. 403-408pp. 408-417
||colspan=2 | Explanation based learning, relevance based learning, inductive logic programming, case based reasoning

{{Harvnb|Russell|Norvig|2003|pp=678-710}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=414-416}},

{{Harvnb|Luger|Stubblefield|2004|pp=~422-442}},

{{Harvnb|Nilsson|1998|loc=chpt. 10.3, 17.5}}

pp. 678-710pp. 414-416pp. ~422-442chpt. 10.3, 17.5
|

|colspan=3 | Statistical

{{Harvnb|Russell|Norvig|2003|pp=712-754}},

{{Harvnb|Luger|Stubblefield|2004|pp=453-541}}

pp. 712-754pp. 453-541
||colspan=2| Reinforcement learning (uses elements of decision theory, like utility)

{{Harvnb|Russell|Norvig|2003|pp=763-788}},

{{Harvnb|Luger|Stubblefield|2004|pp=442-449}}

pp. 763-788pp. 442-449Although they consider this "symbolic" learning, Russell and Norvig describe it using statistical concepts. Perhaps it has changed between the two publications.
||colspan=2 | Bayesian learning, including expectation-maximization algorithm

{{Harvnb|Russell|Norvig|2003|pp=712-724}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=424-433}},

{{Harvnb|Nilsson|1998|loc=chpt. 20}}

pp. 712-724pp. 424-433chpt. 20
||colspan=2 | K-nearest neighbor algorithm

{{Harvnb|Russell|Norvig|2003|pp=733-736}}

pp. 733-736
||colspan=2| kernel methods

{{Harvnb|Russell|Norvig|2003|pp=749-752}}

pp. 749-752
||colspan=2 | Connectionism and neural nets

{{Harvnb|Russell|Norvig|2003|pp=736-748}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=408-414}},

{{Harvnb|Luger|Stubblefield|2004|pp=453-505}},

{{Harvnb|Nilsson|1998|loc=chpt. 3}}

pp. 736-748pp. 408-414pp. 453-505chpt. 3
||colspan=1 | Perceptron

{{Harvnb|Russell|Norvig|2003|pp=740-743}},

{{Harvnb|Luger|Stubblefield|2004|pp=458-467}}

pp. 740-743pp. 458-467
||colspan=1 | Backpropagation

{{Harvnb|Russell|Norvig|2003|pp=744-748}},

{{Harvnb|Luger|Stubblefield|2004|pp=467-474}},

{{Harvnb|Nilsson|1998|loc=chpt. 3.3}}

pp. 744-748pp. 467-474chpt. 3.3
||colspan=1 | Competitive learning, Hebbian coincidence learning, Attractor networks

{{Harvnb|Luger|Stubblefield|2004|pp=474-505}}

pp. 474-505
||colspan=2 | Social and emergent

{{Harvnb|Luger|Stubblefield|2004|pp=507-542}},

{{Harvnb|Nilsson|1998|loc=chpt. 4}}

pp. 507-542chpt. 4
||colspan=1 | Classifiers and genetic algorithms

{{Harvnb|Luger|Stubblefield|2004|pp=509-530}},

{{Harvnb|Nilsson|1998|loc=chpt. 4.2}}

pp. 509-530chpt. 4.2
||colspan=1 | Artificial life and society based learning

{{Harvnb|Luger|Stubblefield|2004|pp=530-541}}

pp. 530-541
colspan=4 | Natural language processing{{Harvnb|ACM|1998|loc=I.2.7}},

{{Harvnb|Russell|Norvig|2003|pp=790-831}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=91-104}},

{{Harvnb|Luger|Stubblefield|2004|pp=591-632}}

I.2.7pp. 790-831pp. 91-104pp. 591-632
|

|colspan=3 | Syntax and parsing

{{Harvnb|Russell|Norvig|2003|pp=795-810}},

{{Harvnb|Luger|Stubblefield|2004|pp=597-616}}

pp. 795-810pp. 597-616
|

|colspan=3 | Semantics and disambiguation

{{Harvnb|Russell|Norvig|2003|pp=810-821}}

pp. 810-821
|

|colspan=3 | Discourse understanding: coherence relations, speech acts, pragmatics

{{Harvnb|Russell|Norvig|2003|pp=820-824}}

pp. 820-824
|

|colspan=3 | Probabilistic methods (learning)

{{Harvnb|Russell|Norvig|2003|pp=834-840}},

{{Harvnb|Luger|Stubblefield|2004|pp=616-623}}

pp. 834-840pp. 616-623
|

|colspan=3 | Applications

{{Harvnb|Russell|Norvig|2003|pp=840-857}},

{{Harvnb|Luger|Stubblefield|2004|pp=623-630}}

pp. 840-857pp. 623-630
||colspan=2 | Information retrieval and text mining

{{Harvnb|Russell|Norvig|2003|pp=857-850}}

pp. 840-850
||colspan=2 | Machine translation

{{Harvnb|Russell|Norvig|2003|pp=850-857}}

pp. 850-857
colspan=4 | Perception

{{Harvnb|Russell|Norvig|2003|pp=537-581, 863-898}},

{{Harvnb|Nilsson|1998|loc=~chpt. 6}}

pp. 537-581, 863-898~chpt. 6
|

|colspan=3 | Perception with stochastic temporal models

{{Harvnb|Russell|Norvig|2003|pp=547-581}}

pp. 547-581
||colspan=2 | Hidden markov models

{{Harvnb|Russell|Norvig|2003|pp=549-551}}

pp. 549-551
||colspan=2 | Kalman filters

{{Harvnb|Russell|Norvig|2003|pp=551-559}}

pp. 551-559
||colspan=2 | Dynamic Bayesian networks

{{Harvnb|Russell|Norvig|2003|pp=559-568}}

pp. 559-568
|

|colspan=3 | Speech recognition

{{Harvnb|ACM|1998|loc=~I.2.7}},

{{Harvnb|Russell|Norvig|2003|pp=568-578}}

~I.2.7pp. 568-578
|

|colspan=3 | Machine vision

{{Harvnb|ACM|1998|loc=I.2.10}},

{{Harvnb|Russell|Norvig|2003|pp=863-898}},

{{Harvnb|Nilsson|1998|loc=chpt. 6}}

I.2.10pp. 863-898chpt. 6
colspan=4 | Robotics

{{Harvnb|ACM|1998|loc=I.2.9}},

{{Harvnb|Russell|Norvig|2003|pp=901-942}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=443-460}}

I.2.9pp. 901-942pp. 443-460
|

|colspan=3 | Control theory

{{Harvnb|ACM|1998|loc=~I.2.8}},

{{Harvnb|Russell|Norvig|2003|pp=926-932}}

~I.2.8pp. 926-932
colspan=4 | Specialized languages

{{Harvnb|ACM|1998|loc=I.2.5}},

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=477-491}},

{{Harvnb|Luger|Stubblefield|2004|pp=641-821}}

I.2.5pp. 477-491pp. 641-821
|

|colspan=3 | Prolog

{{Harvnb|Poole|Mackworth|Goebel|1998|pp=477-491}},

{{Harvnb|Luger|Stubblefield|2004|pp=641-676, 575-581}}

pp. 477-491pp. 641-676, 575-581
|

|colspan=3 | Lisp

{{Harvnb|Luger|Stubblefield|2004|pp=723-821}}

p. 723-821
colspan=4 | Applications of AI

{{Harvnb|ACM|1998|loc=I.2.1}}

I.2.1
|

|colspan=3 | Expert systems

{{Harvnb|ACM|1998|loc=I.2.1}},

{{Harvnb|Luger|Stubblefield|2004|pp=227-331}},

{{Harvnb|Nilsson|1998|loc=chpt. 17.4}}

I.2.1(several mentions)pp. 227-331chpt. 17.4
colspan=4 | Automatic programming (other sources don't consider this AI)

{{Harvnb|ACM|1998|loc=I.2.2}}

I.2.2

Notes

{{reflist}}

---- CharlesGillingham (talk) 00:05, 30 November 2007 (UTC)