Introduction To AI
Introduction To AI
(CS F407)
Introduction
Chittaranjan Hota
Professor, Computer Science & Information Systems Department
BITS Pilani Hyderabad Campus, Hyderabad
[email protected]
08.01.2018
Why Artificial Intelligence?
• "AI will add 2.3 million jobs by 2020“. ~ Gartner
• Just as consumer appliances have microprocessors,
apps will have AI. ~ Gartner, Jan 2017.
• AI is the Next Industrial Revolution. ~ Wall Street Journal,
August 2017.
• Robots 'are here to give us a promotion,' not take away
jobs. ~Gartner, 2017.
Norah AI media engine consists of a vast neural network, which can be used by interactive
content designers to create games in a short time. The content creators can train the machine
with a movie and Norah AI will automatically generate a high-end game by learning from the
movie's script and the characters that inhabit it.
Niki.ai: Shop on chat using
NLP and ML
GAN: Two NNs contesting
with each other (2014)
• 1990s ALICE
• Loebner prize- win
$25,000 if you pass the
test (2017)
Achieved. (Siri! )
https://chatbotsmagazine.com/how-to-win-a-turing-test-the-loebner-prize-3ac2752250f1
(Source: Wiki)
Course outline
• Search
• Blind and Heuristic search
• Game playing
• Planning
• Knowledge representation and reasoning
• Propositional logic
• Predicate logic
• Resolution by refutation
• Reasoning under uncertainty
• Natural language understanding
• Machine learning
• Supervised learning (= learning from examples)
• Reinforcement learning (= learning by reinforcement)
Evaluation Scheme
Sl Component & Nature Duration Weightage Date and
No. Time
1. Coding Assignments (Take Home, Three * 30% ---
Numbers)
2. Announced Quizzes (Two) 30 mins 10% ---
3. Mid sem Test (Closed Book) 1.5 hr 25% 06/03
3.30 – 5.00
4. Comprehensive Exam (Part Open) 3 hrs 35% 04/05 AN
• Speech recognition
• Computer vision
Continued…
• Financial Decision Making
Credit risk assessment by Indian banks,…
• Natural Language Understanding
how are you आप कैसे हैं
Program 1
Comments:
Advantages:
Efficient in terms of time, optimal game of tic-tac-toe in theory.
Disadvantages:
space?
work?
error prone - move table
three dimension - 327, no longer work at all
Program 2
program 2 board
magic square 15
possible win check:
S = sum of two paired owned by a player
D = 15 – S
if 0 < D < 10 and Board [D] is empty then the player
can win
8 3 4
1 5 9
6 7 2
Program 3
Data structure: boardposition (a nine element vector representing the
board, a list of board positions that could result from the next move, and
a number representing how likely it is going to lead to a win)
Comments:
1. Require much more
time to consider all
possible moves.
2. Could be extended to
handle more
complicated games.