Chapter 2 Approaches/Methods Artificial Intelligence Instructor: Haris Shahzad Artificial Intelligence CS-402.

Slides:



Advertisements
Similar presentations
1 The following interactive exercises and accompanying assessment quiz was devised by Evelyn M. Sabino, Ph.D Using diagrams obtained from
Advertisements

Structured Design The Structured Design Approach (also called Layered Approach) focuses on the conceptual and physical level. As discussed earlier: Conceptual.
Heuristic Search techniques
Combinational Circuits
Assessment Storyboard. Using this presentation Used to indicate a note on the UI flow A question that is yet to be clarified.This requires inputs from.
How To Start A Blog on Livejournal.com Navigation Creating an Account Naming Your Blog/Editing User Info Customizing Your Blog Updating Your Blog Adding.
AVL Trees Balancing. The AVL Tree An AVL tree is a balanced binary search tree. What does it mean for a tree to be balanced? It means that for every node.
I NTRODUCTION TO THE K ARNAUGH M AP 1 Alan Clements.
Labcliq, How to certify a corrective action
Click here to enter. Click a menu option to view more details Starters Main Courses Desserts Click on the coffee cup to return when Navigating For Vocabulary.
CS 4700: Foundations of Artificial Intelligence Bart Selman Reinforcement Learning R&N – Chapter 21 Note: in the next two parts of RL, some of the figure/section.
Lets remember about Goal formulation, Problem formulation and Types of Problem. OBJECTIVE OF TODAY’S LECTURE Today we will discus how to find a solution.
Backtracking COP Backtracking  Backtracking is a technique used to solve problems with a large search space, by systematically trying and eliminating.
Recursion Chapter 7. Spring 2010CS 2252 Chapter Objectives To understand how to think recursively To learn how to trace a recursive method To learn how.
Fall 2007CS 2251 Recursion Chapter 7. Fall 2007CS 2252 Chapter Objectives To understand how to think recursively To learn how to trace a recursive method.
1 Chapter 15 Introduction to Planning. 2 Chapter 15 Contents l Planning as Search l Situation Calculus l The Frame Problem l Means-Ends Analysis l The.
Artificial Intelligence Methods Rao Vemuri Searching - 2.
Chapter 10 Search Structures Instructors: C. Y. Tang and J. S. Roger Jang All the material are integrated from the textbook "Fundamentals of Data Structures.
Recursion Chapter 7. Chapter 7: Recursion2 Chapter Objectives To understand how to think recursively To learn how to trace a recursive method To learn.
Recursion Chapter 7. Chapter 7: Recursion2 Chapter Objectives To understand how to think recursively To learn how to trace a recursive method To learn.
CHAPTER 10 Recursion. 2 Recursive Thinking Recursion is a programming technique in which a method can call itself to solve a problem A recursive definition.
Testing Test Plans and Regression Testing. Programs need testing! Writing a program involves more than knowing the syntax and semantics of a language.
Table of Contents Solving Linear Systems - Elementary Row Operations A linear system of equations can be solved in a new way by using an augmented matrix.
Fuzzy Logic Jan Jantzen Logic is based on set theory, and when we switch to fuzzy sets it will have an effect on.
When the status is “Report Denied”, means that PMA Admins review the inspection report and they deny it. The Reports Correction Procedure can be start.
Advanced Digital Circuits ECET 146 Week 3 Professor Iskandar Hack ET 221B,
StressChill App Click the StressChill icon (shown to the right) to open the app. If you do not see this on the desktop, you will find it in the pull up.
Chapter 5 Section 5 Counting Techniques.
5.5 Counting Techniques. More Challenging Stuff  The classical method, when all outcomes are equally likely, involves counting the number of ways something.
Factoring – Trinomials (a ≠ 1), Guess and Check It is assumed you already know how to factor trinomials where a = 1, that is, trinomials of the form Be.
MBI 630: Class 6 Logic Modeling 9/7/2015. Class 6: Logic Modeling Logic Modeling Broadway Entertainment Co. Inc., Case –Group Discussion (Handout) –Logic.
B+ Tree What is a B+ Tree Searching Insertion Deletion.
Lecture 1 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 Uncertainty: Data and Chance.
1 State Space of a Problem Lecture 03 ITS033 – Programming & Algorithms Asst. Prof.
X = 11 X 2 = 9 X = 3 Check: X = 3 x 3 +2 = 11 We can solve this equation by:
Recursion Chapter 7. Chapter Objectives  To understand how to think recursively  To learn how to trace a recursive method  To learn how to write recursive.
WAES 3308 Numerical Methods for AI
CS 376 Introduction to Computer Graphics 04 / 16 / 2007 Instructor: Michael Eckmann.
Table of Contents Factoring – Trinomials (a ≠ 1), Guess and Check It is assumed you already know how to factor trinomials where a = 1, that is, trinomials.
C++ Programming Language Lecture 2 Problem Analysis and Solution Representation By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
REV. TIMOTHY THOMPSON, SR. - PRESENTER HOW TO ENTER YOUR GOALS.
CS 206 Introduction to Computer Science II 10 / 05 / 2009 Instructor: Michael Eckmann.
Chapter 3 Digital Logic Structures. 3-2 Combinational vs. Sequential Combinational Circuit always gives the same output for a given set of inputs  ex:
GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.
G5BAIM Artificial Intelligence Methods Graham Kendall Searching.
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL State Machines Anselmo Lastra.
Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu Blind Searches - Introduction.
CS1Q Computer Systems Lecture 8
The Hashemite University Computer Engineering Department
Search in State Spaces Problem solving as search Search consists of –state space –operators –start state –goal states A Search Tree is an efficient way.
© 2006 Pearson Addison-Wesley. All rights reserved 6-1 Chapter 6 Recursion as a Problem- Solving Technique.
February 11, 2016Introduction to Artificial Intelligence Lecture 6: Search in State Spaces II 1 State-Space Graphs There are various methods for searching.
G5AIAI Introduction to AI
Basic Technical Drawing Centering a Drawing By Tim Closs.
Tests of Significance We use test to determine whether a “prediction” is “true” or “false”. More precisely, a test of significance gets at the question.
Week 1 Real Numbers and Their Properties (Section 1.6, 1.7, 1.8)
5 Why analysis By its very nature, a Lean Six Sigma program requires a number of changes throughout the organization. That’s what we are trying to do right?
Recursion Topic 5.
KS4 Mathematics A2 Linear equations.
Done Done Course Overview What is AI? What are the Major Challenges?
CS 4700: Foundations of Artificial Intelligence
(edited by Nadia Al-Ghreimil)
Chapter 12 Recursion (methods calling themselves)
Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Nov. 7, 2000
KS4 Mathematics A2 Linear equations.
Presentation transcript:

Chapter 2 Approaches/Methods Artificial Intelligence Instructor: Haris Shahzad Artificial Intelligence CS-402

Today Discussion:  Classical Approach  Generate and Test  Problem Representation Artificial Intelligence CS-402

Chapter:1 Review  What is Intelligence?  What is Artificial Intelligence?  Relations of Intelligence with Artificial Intelligence  Applications of Artificial Intelligence  History of Artificial Intelligence Artificial Intelligence CS-402

Classical Approach Use: Hit & Trial method Works Well: works well for trivial or minor problems & classical approach

Consider the maze searching problem Classical Approach Example & Considerations:1

Consider that a toddler is to switch on the light in a dark room Classical Approach Example & Considerations:2

Consider another situation when we have to open a combinational lock of a briefcase Classical Approach Example & Considerations:3

Generate and Test This is a technical name given to the classical way of solving problems where we generate different combinations to solve our problem, and the one which solves the problem is taken as the correct solution. The rest of the combinations that we try are considered as incorrect solutions and hence are destroyed.

Generate and Test Diagram & Example

The diagram in previous slide shows a simple arrangement of a Generate and Test procedure. The box on the left labeled “Solution Generator” generates different solutions to a problem at hand, e.g. in the case of maze searching problem, the solution generator can be thought of as a machine that generates different paths inside a maze. The “Tester” actually checks that either a possible solution from the solution generates solves out problem or not. Again in case of maze searching the tester can be thought of as a device that checks that a path is a valid path for the mouse to reach the cheese. In case the tester verifies the solution to be a valid path, the solution is taken to be the “Correct Solution”. On the other hand if the solution was incorrect, it is discarded as being an “Incorrect Solution”. Diagram Explanation

Problem Representation All the problems that we have seen till now were trivial in nature. When the magnitude of the problem increases and more parameters are added, e.g. the problem of developing a time table, then we have to come up with procedures better than simple Generate and Test approach. Before even thinking of developing techniques to systematically solve the problem, we need to know one more thing that is true about problem solving namely problem representation. The key to problem solving is actually good representation of a problem. Natural representation of problems is usually done using graphics and diagrams to develop a clear picture of the problem in your mind. As an example to our comment consider the diagram below.

Problem Representation Diagram & Example

It shows the problem of switching on the light by a toddler in a graphical form. Each rectangle represents the state of the switch board. OFF | OFF| OFF means that all the three switches are OFF. Similarly OFF| ON | OFF means that the first and the last switch is OFF and the middle one is ON. Starting from the state when all the switches are OFF the child can proceed in any of the three ways by switching either one of the switch ON. This brings the toddler to the next level in the tree. Now from here he can explore the other options, till he gets to a state where the switch corresponding to the light is ON. Hence our problem was reduced to finding a node in the tree which ON is the place corresponding to the light switch. Observe how representing a problem in a nice manner clarifies the approach to be taken in order to solve it. Problem Representation Diagram & Example

?