Artificial Intelligence Artificial Intelligence Course: CS40002 Course: CS40002 Instructor: Dr. Pallab Dasgupta Pallab Dasgupta Instructor: Dr. Department of Computer Science & Engineering Department of Computer Science & Engineering Indian Institute of Technology Kharagpur Kharagpur Indian Institute of Technology
What is AI? What is AI? � Turing Test (1950) Turing Test (1950) � � The computer is interrogated by a human via a teletype The computer is interrogated by a human via a teletype � � It 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 end human at the other end • Sufficiency: The Chinese Room Argument CSE, IIT Kharagpur Kharagpur CSE, IIT 2
The ability to solve problems The ability to solve problems � Search: Search: Efficient trial Efficient trial- -and and- -error error � � Enormous computational complexity Enormous computational complexity � � Space Space- -time trade time trade- -offs offs � � Use of domain knowledge Use of domain knowledge – – heuristics heuristics � Integer Heuristic Prog. Search Evolutionary Dynamic Linear Prog. Algorithms Prog. During 1985- -1995 1995 computation became free computation became free During 1985 CSE, IIT Kharagpur Kharagpur CSE, IIT 3
Knowledge and Deduction Knowledge and Deduction How 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 realization The gap between knowledge and realization � � Logics of knowledge Logics of knowledge � � Knowledge Automated Based Theorem Expert Formal Systems Provers Systems Verification • The knowledge base may be huge The knowledge base may be huge • • Between 1990 • Between 1990 – – 2000 2000 storage became free storage became free CSE, IIT Kharagpur Kharagpur CSE, IIT 4
The ability to learn The ability to learn � Can we learn to solve a problem better? Can we learn to solve a problem better? � � Learning the answers Learning the answers � � Learning the rules of the game Learning the rules of the game � � Learning to plan Learning to plan � � Belief networks Belief networks � � Perceptrons Perceptrons and Neural networks and Neural networks � CSE, IIT Kharagpur Kharagpur CSE, IIT 5
What then is AI? What then is AI? Human Computer Human Computer interaction interaction Computer vision Computer vision Automated Problem Solving Automated Problem Solving NLP NLP Machine Learning Machine Learning Logic and Deduction Robotics Logic and Deduction Robotics In this decade, communication will become free CSE, IIT Kharagpur Kharagpur CSE, IIT 6
Fundamentals Fundamentals � The notion of expressing computation as an The notion of expressing computation as an � algorithm algorithm � 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 undecidable are undecidable: that is, their truth cannot be established by : that is, their truth cannot be established by any algorithm. any algorithm. CSE, IIT Kharagpur Kharagpur CSE, IIT 7
Fundamentals Fundamentals � Church Church- -Turing Thesis (1936): Turing Thesis (1936): � � The Turing machine is capable of computing any The Turing machine is capable of computing any � computable function computable function � This is the accepted definition of computability This is the accepted definition of computability � � The notion of intractability The notion of intractability � � NP NP- -completeness completeness � � Reduction Reduction � CSE, IIT Kharagpur Kharagpur CSE, IIT 8
Course Outline Course Outline � Problem solving by search Problem solving by search � � State space search, State space search, � � Problem reduction search, Problem reduction search, � � Game playing Game playing � � Logic and deduction Logic and deduction � � First First- -order logic, Temporal logic, Deduction order logic, Temporal logic, Deduction � � Planning Planning � � Reasoning under Uncertainty Reasoning under Uncertainty � � Learning Learning � � Additional Topics Additional Topics � CSE, IIT Kharagpur Kharagpur CSE, IIT 9
References References � Artificial Intelligence Artificial Intelligence – – A Modern Approach A Modern Approach � -- Stuart Russell and Peter Stuart Russell and Peter Norvig Norvig -- � Principles of Artificial Intelligence Principles of Artificial Intelligence � -- N J Nilsson N J Nilsson -- � Heuristics Heuristics � -- Judea Pearl -- Judea Pearl CSE, IIT Kharagpur Kharagpur CSE, IIT 10
Recommend
More recommend
