10
Artificial Intelligence Artificial Intelligence Course: CS40002 Course: CS40002 Instructor: Dr. Instructor: Dr. Pallab Dasgupta Pallab Dasgupta Department of Computer Science & Engineering Department of Computer Science & Engineering Indian Institute of Technology Indian Institute of Technology Kharagpur Kharagpur

Artificial Intelligence - IIT Kanpur

  • Upload
    sangram

  • View
    279

  • Download
    6

Embed Size (px)

DESCRIPTION

Artificial Intelligence A Seminar By Prof. Pallab IIT Kanpur.....Must Read

Citation preview

Artificial IntelligenceArtificial Intelligence

Course: CS40002Course: CS40002Instructor: Dr. Instructor: Dr. Pallab DasguptaPallab Dasgupta

Department of Computer Science & EngineeringDepartment of Computer Science & EngineeringIndian Institute of Technology Indian Institute of Technology KharagpurKharagpur

2CSE, IIT CSE, IIT KharagpurKharagpur

What is AI?What is AI?

Turing Test (1950)Turing Test (1950)The computer is interrogated by a human via a teletypeThe computer is interrogated by a human via a teletypeIt passes if the human cannot tell if there is a computer or It passes if the human cannot tell if there is a computer or human at the other endhuman at the other end

• Sufficiency: The Chinese Room Argument

3CSE, IIT CSE, IIT KharagpurKharagpur

The ability to solve problemsThe ability to solve problems

Search: Search: Efficient trialEfficient trial--andand--errorerrorEnormous computational complexityEnormous computational complexitySpaceSpace--time tradetime trade--offsoffsUse of domain knowledge Use of domain knowledge –– heuristicsheuristics

IntegerProg.

LinearProg.

DynamicProg.

HeuristicSearch Evolutionary

Algorithms

During 1985During 1985--1995 1995 computation became freecomputation became free

4CSE, IIT CSE, IIT KharagpurKharagpur

Knowledge and DeductionKnowledge and DeductionHow to store and retrieve knowledge?How to store and retrieve knowledge?How to interpret facts and rules, and be able to deduce?How to interpret facts and rules, and be able to deduce?The gap between knowledge and realizationThe gap between knowledge and realizationLogics of knowledgeLogics of knowledge

KnowledgeBased

Systems ExpertSystems

AutomatedTheoremProvers Formal

Verification

•• The knowledge base may be hugeThe knowledge base may be huge•• Between 1990 Between 1990 –– 2000 2000 storage became freestorage became free

5CSE, IIT CSE, IIT KharagpurKharagpur

The ability to learnThe ability to learn

Can we learn to solve a problem better?Can we learn to solve a problem better?Learning the answersLearning the answersLearning the rules of the gameLearning the rules of the gameLearning to planLearning to plan

Belief networksBelief networks

PerceptronsPerceptrons and Neural networksand Neural networks

6CSE, IIT CSE, IIT KharagpurKharagpur

What then is AI?What then is AI?

Automated Problem SolvingAutomated Problem Solving

Logic and DeductionLogic and Deduction

Machine LearningMachine Learning

Computer visionComputer vision

NLPNLP

RoboticsRobotics

Human ComputerHuman Computerinteractioninteraction

In this decade, communication will become free

7CSE, IIT CSE, IIT KharagpurKharagpur

FundamentalsFundamentals

The notion of expressing computation as an The notion of expressing computation as an algorithmalgorithm

Godel’s Godel’s Incompleteness Theorem (1931):Incompleteness Theorem (1931):

In any language expressive enough to describe the In any language expressive enough to describe the properties of natural numbers, there are true statements that properties of natural numbers, there are true statements that are are undecidableundecidable: that is, their truth cannot be established by : that is, their truth cannot be established by any algorithm.any algorithm.

8CSE, IIT CSE, IIT KharagpurKharagpur

FundamentalsFundamentals

ChurchChurch--Turing Thesis (1936):Turing Thesis (1936):The Turing machine is capable of computing any The Turing machine is capable of computing any computable functioncomputable functionThis is the accepted definition of computabilityThis is the accepted definition of computability

The notion of intractabilityThe notion of intractabilityNPNP--completenesscompletenessReductionReduction

9CSE, IIT CSE, IIT KharagpurKharagpur

Course OutlineCourse Outline

Problem solving by searchProblem solving by searchState space search, State space search, Problem reduction search, Problem reduction search, Game playingGame playing

Logic and deductionLogic and deductionFirstFirst--order logic, Temporal logic, Deductionorder logic, Temporal logic, Deduction

PlanningPlanningReasoning under UncertaintyReasoning under UncertaintyLearningLearningAdditional TopicsAdditional Topics

10CSE, IIT CSE, IIT KharagpurKharagpur

ReferencesReferences

Artificial Intelligence Artificial Intelligence –– A Modern ApproachA Modern Approach---- Stuart Russell and Peter Stuart Russell and Peter NorvigNorvig

Principles of Artificial IntelligencePrinciples of Artificial Intelligence---- N J NilssonN J Nilsson

HeuristicsHeuristics---- Judea PearlJudea Pearl