 Define A.I and discuss its application areas in detail.  Explain Turing test. why it is not justifiable to use it to test whether the machine is intelligent.

Slides:



Advertisements
Similar presentations
Presentation on Artificial Intelligence
Advertisements

Big Ideas in Cmput366. Search Blind Search State space representation Iterative deepening Heuristic Search A*, f(n)=g(n)+h(n), admissible heuristics Local.
CHAPTER 13 Inference Techniques. Reasoning in Artificial Intelligence n Knowledge must be processed (reasoned with) n Computer program accesses knowledge.
Propositional Logic Reading: C , C Logic: Outline Propositional Logic Inference in Propositional Logic First-order logic.
CS 484 – Artificial Intelligence1 Announcements Choose Research Topic by today Project 1 is due Thursday, October 11 Midterm is Thursday, October 18 Book.
Artificial Intelligence for Games Patrick Olivier & John Shearer
Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.
Rule Based Systems Alford Academy Business Education and Computing
Midterm Review CMSC421 – Fall CH1 Summary: Intro AI Definitions: dimensions human/rational think/act Three Major Components of AI Algorithms Representation.
Artificial Intelligence Course review AIMA. Four main themes Problem solving by search Uninformed search Informed search Constraint satisfaction Adversarial.
Cooperating Intelligent Systems Course review AIMA.
1 Heuristic Search 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games.
Chapter 13 Artificial Intelligence. Introduction Artificial intelligence (AI) is the part of computer science that attempts to make computers act like.
Control and Implementation of State Space Search
Artificial Intelligence CAP492
1 Chapter 9 Rules and Expert Systems. 2 Chapter 9 Contents (1) l Rules for Knowledge Representation l Rule Based Production Systems l Forward Chaining.
Production Rules Rule-Based Systems. 2 Production Rules Specify what you should do or what you could conclude in different situations. Specify what you.
EXPERT SYSTEMS Part I.
CPSC 433 Artificial Intelligence CPSC 433 : Artificial Intelligence Tutorials T01 & T02 Andrew “M” Kuipers note: please include.
Artificial Intelligence CSC 361
Expert Systems Infsy 540 Dr. Ocker. Expert Systems n computer systems which try to mimic human expertise n produce a decision that does not require judgment.
INFERENCE IN FIRST-ORDER LOGIC IES 503 ARTIFICIAL INTELLIGENCE İPEK SÜĞÜT.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
13: Inference Techniques
Traditional game playing 2 player adversarial (win => lose) based on search but... huge game trees can't be fully explored.
1 CHAPTER 13 Decision Support Systems and Intelligent Systems, Efraim Turban and Jay E. Aronson 6th ed, Copyright 2001, Prentice Hall, Upper Saddle River,
Logical Agents Logic Propositional Logic Summary
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
George F Luger ARTIFICIAL INTELLIGENCE 6th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
 Dr. Syed Noman Hasany 1.  Review of known methodologies  Analysis of software requirements  Real-time software  Software cost, quality, testing.
Chapter 13 Artificial Intelligence and Expert Systems.
CS62S: Expert Systems Based on: The Engineering of Knowledge-based Systems: Theory and Practice, A. J. Gonzalez and D. D. Dankel.
The AI War LISP and Prolog Basic Concepts of Logic Programming
KNOWLEDGE BASED SYSTEMS
Inferencing in rule-based systems: forward and backward chaining.
Chapter 4: Inference Techniques
RULES Patty Nordstrom Hien Nguyen. "Cognitive Skills are Realized by Production Rules"
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
Natural Language Processing AI Revision Lee McCluskey, room 2/07
1 Final Exam Review CS 171/ Coverage Problem Solving and Searching Chapters 3,4,6 Logic Chapters 7,8,9 LISP Only those sections covered in the slides.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 14 of 42 Wednesday, 22.
Some Thoughts to Consider 5 Take a look at some of the sophisticated toys being offered in stores, in catalogs, or in Sunday newspaper ads. Which ones.
Computing & Information Sciences Kansas State University Wednesday, 04 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 04 October.
Explaining and Controlling Reasoning Dr Nicholas Gibbins 32/3077.
COMPUTER SYSTEM FUNDAMENTAL Genetic Computer School INTRODUCTION TO ARTIFICIAL INTELLIGENCE LESSON 11.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
Artificial Intelligence
AI Classnotes #5, John Shieh, 2012
CS3754 Class Notes, John Shieh, 2012
Preserving and Applying Human Expertise: Knowledge-Based Systems
CS 460 Spring 2011 Lecture 4.
TECHNOLOGY GUIDE FOUR Intelligent Systems.
Review of AI Professor: Liqing Zhang
Knowledge Representation
CSE 4705 Artificial Intelligence
Announcements Homework 3 due today (grace period through Friday)
Knowledge Representation and Inference
CSE 4705 Artificial Intelligence
Artificial Intelligence
Review session covering text book pages and
KNOWLEDGE REPRESENTATION
Search and Game Playing
2/24/2019.
Approaches to search Simple search Heuristic search Genetic search
SEG 4560 Midterm Review.
8/2/2019.
Adversarial Search Game Theory.
Presentation transcript:

 Define A.I and discuss its application areas in detail.  Explain Turing test. why it is not justifiable to use it to test whether the machine is intelligent or not.  What do you understand by a production system? What are the components of it? Discuss the different conflict resolution strategies used in production system.  A) What do you understand by CNF and DNF?  B) Explain the rule of modus ponen and modus tollen. Explain how they are used in every day life.  What do you understand by an Admissible Heuristic? Write the A* algorithm& using example show that A* search algorithm is Admissible.

 What do you understand by mini-max search? Discuss the use of alpha & beta pruning in improving the mini-max search. Use suitable example.  What do you mean by Knowledge Acquisition? Explain knowledge acquisition strategies.  Define Expert system. What are its applications? Discuss the different stages of expert system development.  Explain Non-Production Architecture of Expert System.  Discuss the following: A) Beam search B) Best first search  What do you understand by Learning? Explain the learning as induction using suitable examples.

 What do you understand by state space representation? Explain.  Differentiate between following: (A) Procedural knowledge and Declarative knowledge (B) Frame and Scripts  What is AI? Differentiate between AI Programming and conventional programming.  Explain the difference between forward chaining and backward chaining. Explain the factors that can be used to decide the direction of search.  Explain the following properties of search algorithms: (A) Monotonicity(B) Optimality (C) Informedness(D) Admissibility