The Foundations of Artificial Intelligence. Our Working Definition of AI Artificial intelligence is the study of how to make computers do things that.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Presentation on Artificial Intelligence
Introduction to AI Kaziwa H. Saleh. What is AI? John McCarthy defines AI as “the science and engineering to make intelligent machines”. AI is the study.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
WHAT IS ARTIFICIAL INTELLIGENCE?
Will Androids Dream of Electric Sheep? A Glimpse of Current and Future Developments in Artificial Intelligence Henry Kautz Computer Science & Engineering.
Approaches to AI. Robotics Versus Artificial Intelligence.
Overview and History of Cognitive Science
Overview and History of Cognitive Science. How do minds work? What would an answer to this question look like? What is a mind? What is intelligence? How.
CSE 471/598,CBS598 Introduction to Artificial Intelligence Fall 2004
Random Administrivia In CMC 306 on Monday for LISP lab.
1 4 questions (Revisited) What are our underlying assumptions about intelligence? What kinds of techniques will be useful for solving AI problems? At what.
ARTIFICIAL INTELLIGENCE Introduction: Chapter Textbook: S. Russell and P. Norvig Artificial Intelligence: A Modern Approach Prentice Hall, 2003,
ARTIFICIAL INTELLIGENCE Artificial intelligence (AI) is the intelligence exhibited by machines or software. It is an academic field of study which studies.
Brute Force Search Depth-first or Breadth-first search
Introduction to AI, H. Feili 1 Introduction to Artificial Intelligence LECTURE 1: Introduction What is AI? Foundations of AI The.
1 Artificial Intelligence An Introductory Course.
CPSC 171 Artificial Intelligence Read Chapter 14.
Artificial Intelligence: Its Roots and Scope
FOUNDATIONS OF ARTIFICIAL INTELLIGENCE Introduction: Chapter 1.
ARTIFICIAL INTELLIGENCE Introduction: Chapter 1. Outline Course overview What is AI? A brief history The state of the art.
Artificial Intelligence Lecture No. 15 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
1 AI and Agents CS 171/271 (Chapters 1 and 2) Some text and images in these slides were drawn from Russel & Norvig’s published material.
CISC4/681 Introduction to Artificial Intelligence1 Introduction – Artificial Intelligence a Modern Approach Russell and Norvig: 1.
Artificial Intelligence Introduction (2). What is Artificial Intelligence ?  making computers that think?  the automation of activities we associate.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
CS206Evolutionary Robotics “Cogito ergo sum.”. CS206Evolutionary Robotics “Cogito ergo sum.” “I think, therefore I am.” “Do I exist?” “There is something.
19/13/2015CS360 AI & Robotics CS360: AI & Robotics TTh 9:25 am - 10:40 am Shereen Khoja
Introduction: Chapter 1
Artificial Intelligence: An Introduction Definition of AI Foundations of AI History of AI Advanced Techniques.
An Introduction to Artificial Intelligence and Knowledge Engineering N. Kasabov, Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering,
CSC4444: Artificial Intelligence Fall 2011 Dr. Jianhua Chen Slides adapted from those on the textbook website.
Artificial Intelligence: Prospects for the 21 st Century Henry Kautz Department of Computer Science University of Rochester.
Psy Introduction1 Introduction Psychology 612.
CNS 4470 Artificial Intelligence. What is AI? No really what is it? No really what is it?
1 Artificial Intelligence GholamReza GhassemSani Fall 1383.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
Introduction to Artificial Intelligence and Soft Computing
Expert Systems Robots Unlimited, p. 234 – Expert Systems Expert knowledge in many domains can be captured as rules. Dendral (1965 – 1975) If: The.
Early Artificial Intelligence. Our Working Definition of AI Artificial intelligence is the study of how to make computers do things that people are better.
1 Introduction to Artificial Intelligence (Lecture 1)
Due Monday Read chapter 2 Homework: –Chapter 1, exercises –Answer each in 100 words or less. Send to from your preferred.
Intro to Computation and AI Dr. Jill Fain Lehman School of Computer Science Lecture 6: December 4, 1997.
Part II: Artificial Intelligence as Representation and Search
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
AI: Can Machines Think? Juntae Kim Department of Computer Engineering Dongguk University.
Artificial Intelligence. Our Working Definition of AI Artificial intelligence is the study of how to make computers do things that people are better at.
History of AI By: Stephen Fandrich. AI Development Timeline.
Reasoning as Search. Reasoning We can describe reasoning as search in a space of possible situations.
KNOWLEDGE BASED SYSTEMS
Introduction to Artificial Intelligence CS 438 Spring 2008.
FOUNDATIONS OF ARTIFICIAL INTELLIGENCE
Princess Nora University Artificial Intelligence CS 461 Level 8 1.
Vilalta/Norvig/Eick: History of AI Origins McCulloch and Pitts (1943) Model of Artificial Neurons. Donald Hebb (1949) Hebbian Learning Conference at Dartmouth.
Artificial Intelligence, simulation and modelling.
1 Artificial Intelligence & Prolog Programming CSL 302.
Survey on Expert System Seung Jun Lee Dept. of Nuclear and Quantum Engineering KAIST Mar 3, 2003.
Expert Systems Chapter Artificial IntelligenceChapter 82 Expert System p. 547 MYCIN (1976) see section 8.2 backward chaining + certainty factor.
Artificial Intelligence
“... artificial intelligence [AI] is the science of making machines do things that would require intelligence if done by [humans]” (Minsky, 1963) ARTIFICIAL.
第 1 章 绪论.
Introduction Artificial Intelligent.
Artificial Intelligence introduction(2)
Introduction to Artificial Intelligence and Soft Computing
Introduction to Artificial Intelligence
AI and Agents CS 171/271 (Chapters 1 and 2)
Artificial Intelligence Chapter 1 Introduction
Search.
Search.
Introduction to Artificial Intelligence
Presentation transcript:

The Foundations of Artificial Intelligence

Our Working Definition of AI Artificial intelligence is the study of how to make computers do things that people are better at or would be better at if: they could extend what they do to a World Wide Web-sized amount of data and not make mistakes.

Why AI? "AI can have two purposes. One is to use the power of computers to augment human thinking, just as we use motors to augment human or horse power. Robotics and expert systems are major branches of that. The other is to use a computer's artificial intelligence to understand how humans think. In a humanoid way. If you test your programs not merely by what they can accomplish, but how they accomplish it, they you're really doing cognitive science; you're using AI to understand the human mind." - Herb Simon

A Time Line View the time linetime line

The Dartmouth Conference and the Name Artificial Intelligence J. McCarthy, M. L. Minsky, N. Rochester, and C.E. Shannon. August 31, "We propose that a 2 month, 10 man study of artificial intelligence be carried out during the summer of 1956 at Dartmouth College in Hanover, New Hampshire. The study is to proceed on the basis of the conjecture that every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it."

The Origins of AI Hype 1950 Turing predicted that in about fifty years "an average interrogator will not have more than a 70 percent chance of making the right identification after five minutes of questioning" Newell and Simon predicted that "Within ten years a computer will be the world's chess champion, unless the rules bar it from competition."

Symbolic vs. Subsymbolic AI Subsymbolic AI: Model intelligence at a level similar to the neuron. Let such things as knowledge and planning emerge. Symbolic AI: Model such things as knowledge and planning in data structures that make sense to the programmers that build them. (blueberry (isa fruit) (shape round) (color purple) (size.4 inch))

The Origins of Subsymbolic AI 1943 McCulloch and Pitts A Logical Calculus of the Ideas Immanent in Nervous Activity “Because of the “all-or-none” character of nervous activity, neural events and the relations among them can be treated by means of propositional logic”

The Origins of Symbolic AI Games Theorem proving

Knowledge Acquisition Hand CraftedMachine Learning Symbolic Subsymbolic

What Are the Components of Intelligence?

Image Perception 424d961d e b a d e e ffffff00e0a a38a388a08a00a a38a a00a00a a a00a a00a00a008008a380280a00a00a a00a00a a eb8e00e380e80 e38e38abf8e00e38aab8e380380a80a38a388abfe3fffffc000e1c71c71c775c71 c71c701c71c01c074071c700775e01c71c c71c01c e01c01c e01c01c e e e00001c c701c c71c7fc701c 71c71c c71c71ff7fffffc000e a a a a a a a aa2aaaabc000e c000e

Image Perception

But We’re Still Ahead

But We’re Still Ahead

Reasoning We can describe reasoning as search in a space of possible situations.

Recall the 8-Puzzle What are the states? Start state Goal state

Hotel Maid States: Start state: Operators: Goal state:

The British Museum Algorithm A simple algorithm: Generate and test But suppose that each time we end a path, we start over at the top and choose the next path randomly. If we try this long enough, we may eventually hit a solution. We’ll call this The British Museum Algorithm or The Monkeys and Typewriters Algorithm

Branch and Bound Consider the problem of planning a ski vacation. Fly to A $600Fly to B $800Fly to C $2000 Stay D $200 (800) Stay E $250 (850) Total cost (1200)

Problem Reduction Goal: Acquire TV Steal TVEarn MoneyBuy TV Or another one: Theorem proving in which we reason backwards from the theorem we’re trying to prove.

What is a Heuristic?

Example From the initial state, move A to the table. Three choices for what to do next. A local heuristic function: Add one point for every block that is resting on the thing it is supposed to be resting on. Subtract one point for every block that is sitting on the wrong thing.

A New Heuristic From the initial state, move A to the table. Three choices for what to do next. A global heuristic function: For each block that has the correct support structure (i. e., the complete structure underneath it is exactly as it should be), add one point for every block in the support structure. For each block that has an incorrect support structure, subtract one point for every block in the existing support structure.

Hill Climbing – Another Example Problem: You have just arrived in Washington, D.C. You’re in your car, trying to get downtown to the Washington Monument.

Hill Climbing – Some Problems

Hill Climbing – Is Close Good Enough? A B Is A good enough? Choose winning lottery numbers

Hill Climbing – Is Close Good Enough? A B Is A good enough? Choose winning lottery numbers Get the cheapest travel itinerary Clean the house

The Silver Bullet? Is there an “intelligence algorithm”? 1957GPS (General Problem Solver) Start Goal

The Silver Bullet? Is there an “intelligence algorithm”? 1957GPS (General Problem Solver) Start Goal What we think now: Probably not

But What About Knowledge? Why do we need it? How can we represent it and use it? How can we acquire it? Find me stuff about dogs who save people’s lives.

But What About Knowledge? Why do we need it? How can we represent it and use it? How can we acquire it? Find me stuff about dogs who save people’s lives. Two beagles spot a fire. Their barking alerts neighbors, who call 911.

Expert Systems Expert knowledge in many domains can be captured as rules. Dendral (1965 – 1975) If: The spectrum for the molecule has two peaks at masses x 1 and x 2 such that: x 1 + x 2 = molecular weight + 28, x is a high peak, x 2 – 28 is a high peak, and at least one of x 1 or x 2 is high, Then: the molecule contains a ketone group.

To Interpret the Rule Mass spectometry Ketone group:

Expert Systems in Medicine 1975Mycin attached probability-like numbers to rules: If: (1) the stain of the organism is gram-positive, and (2) the morphology of the organism is coccus, and (3) the growth conformation of the organism is clumps Then: there is suggestive evidence (0.7) that the identity of the organism is stphylococcus.

Watson How does Watson win? Watch a sample round: From Day 1 of the real match: Introduction: IBM’s site: Bad Final Jeopardy: Explanation:

Expert Systems – Today: Medicine Expert systems work in all these areas: arrhythmia recognition from electrocardiograms coronary heart disease risk group detection monitoring the prescription of restricted use antibiotics early melanoma diagnosis gene expression data analysis of human lymphoma breast cancer diagnosis

Dr. Watson A machine like that is like 500,000 of me sitting at Google and Pubmed.

But What About Things That All of Us Know?