CPSC 322 Introduction to Artificial Intelligence September 13, 2004.

Slides:



Advertisements
Similar presentations
How do look at problems? Do you give up when faced with a problem? Do problems cause you to ask more questions? In this class and in life you will face.
Advertisements

Presentation on Artificial Intelligence
Computation and representation Joe Lau. Overview of lecture What is computation? Brief history Computational explanations in cognitive science Levels.
CPSC 322 Introduction to Artificial Intelligence November 5, 2004.
Chapter 10 Algorithmic Thinking. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Learning Objectives List the five essential.
1 OSCAR: An Architecture for Generally Intelligent Agents John L. Pollock Philosophy and Cognitive Science University of Arizona
Intervening Variables Intervening variables are hypothetical internal states that are used to explain relationships between observed variables, such independent.
CPSC 322 Introduction to Artificial Intelligence October 6, 2004.
CPSC 322 Introduction to Artificial Intelligence September 22, 2004.
CPSC 322 Introduction to Artificial Intelligence September 15, 2004.
CPSC 322 Introduction to Artificial Intelligence October 29, 2004.
CPSC 322 Introduction to Artificial Intelligence October 13, 2004.
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
Artificial Intelligence u What are we claiming when we talk about AI? u How are Turing Machines important? u How can we determine whether a machine can.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.5 [P]: Propositions and Inference Sections.
CPSC 411, Fall 2008: Set 12 1 CPSC 411 Design and Analysis of Algorithms Set 12: Undecidability Prof. Jennifer Welch Fall 2008.
CPSC 322 Introduction to Artificial Intelligence September 20, 2004.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 531 Artificial Intelligence Ch.1 [P]: Artificial Intelligence and Agents.
Approaches to AI. Robotics Versus Artificial Intelligence.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Acting Humanly: The Turing test (1950) “Computing machinery and intelligence”:   Can machine’s think? or Can machines behave intelligently? An operational.
Algorithms and Problem Solving. Learn about problem solving skills Explore the algorithmic approach for problem solving Learn about algorithm development.
Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Fall 2008.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6 [P]: Reasoning Under Uncertainty Sections.
CPSC 322 Introduction to Artificial Intelligence September 8, 2004.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 2 Jim Martin.
1 CILOG User Manual Bayesian Networks Seminar Sep 7th, 2006.
Introduction to Software Engineering CS-300 Fall 2005 Supreeth Venkataraman.
CPSC 322 Introduction to Artificial Intelligence September 10, 2004.
McGraw-Hill/Irwin ©2005 The McGraw-Hill Companies, All rights reserved ©2005 The McGraw-Hill Companies, All rights reserved McGraw-Hill/Irwin.
Speaking Sample Items for Scoring Practice Speaking Components Speaking Scoring Guide Test Administration Manual Student Speaking Prompts- on CD Input.
Studies in Big Data 4 Weng-Long Chang Athanasios V. Vasilakos MolecularComputing Towards a Novel Computing Architecture for Complex Problem Solving.
Unit 2: Engineering Design Process
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
1 AI and Agents CS 171/271 (Chapters 1 and 2) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Chapter 11: Artificial Intelligence
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
1 An Introduction to Formal Languages and Automata Provided by : Babak Salimi webAdd:
1 Artificial Intelligence Introduction. 2 What is AI? Various definitions: Building intelligent entities. Getting computers to do tasks which require.
Algorithms CS139 – Aug 30, Problem Solving Your roommate, who is taking CS139, is in a panic. He is worried that he might lose his financial aid.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
I Robot.
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Chapter 1 –Defining AI Next Tuesday –Intelligent Agents –AIMA, Chapter 2 –HW: Problem.
EXPERT SYSTEMS or KNOWLEDGE BASED SYSTEMS a. When we wish to encode a rich source of knowledge within the program. and b. The scope of systems.
Chapter 10 Algorithmic Thinking. Learning Objectives Explain similarities and differences among algorithms, programs, and heuristic solutions List the.
Logic: Proof procedures, soundness and correctness CPSC 322 – Logic 2 Textbook §5.2 March 7, 2011.
WHAT IS THIS? Clue…it’s a drink SIMPLE SEQUENCE CONTROL STRUCTURE Introduction A computer is an extremely powerful, fast machine. In less than a second,
Fundamentals of Informatics Lecture 12 The Halting Problem Bas Luttik.
A Brief History of AI Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Helpful hints for planning your Wednesday investigation.
INTRODUCTION TO COMPUTER PROGRAMMING(IT-303) Basics.
Artificial Intelligence
Algorithms and Problem Solving
Chapter 11: Learning Introduction
G. Pullaiah College of Engineering and Technology
Introduction to Computer Programming
Course Instructor: knza ch
CS4341 Introduction to Artificial Intelligence
CPSC 322 Introduction to Artificial Intelligence
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Algorithms and Problem Solving
COMP3710 Artificial Intelligence Thompson Rivers University
Chapter 1: Computational Intelligence and Knowledge
Representations & Reasoning Systems (RRS) (2.2)
Automata theory and formal languages COS 3112 – AUTOMATA THEORY PRELIM PERIOD WEEK 1 AND 2.
Presentation transcript:

CPSC 322 Introduction to Artificial Intelligence September 13, 2004

Highlights from last time We’re moving forward under some assumptions: Whatever intelligence is, it results from some kind of computation and it’s platform independent. It’s not unique to brains. Symbol manipulation is a type of computation that is sufficient to give rise to intelligent behavior. Any symbol manipulation can be carried out on a Turing machine (and, by the way, computers are TMs). But keep in mind that these assumptions may be wrong.

The Diagnostic Assistant Domain

What the Ideal Assistant Should Do Derive effects of faults Search through the space of possible faults Explain its reasoning to human users Derive possible causes for symptoms; rule out other causes Plan courses of tests and repairs to address problems Learn about what symptoms are associated with the faults, the effects of repairs, and accuracy of tests

What Our Assistant Will Do* Tell us whether one specific light bulb is on * today...more to come later

The Intelligent Agent An intelligent agent is a system that acts appropriately for its circumstances and its goal is flexible when faced with changing environments and changing goals learns from experience makes appropriate choices given perceptual limitations and finite computation

The Intelligent Agent as Black Box Prior knowledge Past Experience Goals and Values Observations Actions

The Intelligent Agent as Black Box prior knowledge - how switches and lights work, how malfunctions manifest themselves, what information do tests provide past experiences - data from previous cases including effects of repairs, prevalence of faults, prevalence of symptoms for faults, accuracy of tests goals and values - goals of fixing the device, tradeoffs between fixing or replacing components observations - symptoms of a device in failure

The Intelligent Agent as Black Box Prior knowledge Past Experience Goals and Values Observations Actions Reasoning and Representation System (RRS)

Reasoning and Representation System A language for communication with the computer A way to assign meaning to the language Procedures to compute answers to problems given as input in the language Where does the RRS come from? You!

Five Simple Steps to World Domination (or how to build the black box) 1.Begin with a task domain that you want to characterize 2.Distinguish the things you want to talk about in the domain (the ontology)

What goes into the ontology? Description of what exists in the domain of interest: individuals/”things” properties/attributes of individuals relationships between individuals

Five Simple Steps to World Domination (or how to build the black box) 1.Begin with a task domain that you want to characterize 2.Distinguish the things you want to talk about in the domain (the ontology) 3.Use symbols in the computer to represent objects and relations in the domain. (Symbols denote objects...they’re not really the objects.) 4.Tell the computer the knowledge about the domain. 5.Ask the RRS a question which prompts the RRS to reason with its knowledge to solve a problem, produce answers, or generate actions

Whoa! Dude! Reasoning?! The last step is reasoning? Isn’t this like saying “and then a miracle happens”? Where does the reasoning come from? Why don’t you tell us the 273 steps toward building the reasoning part?

Starting up CILOG From any UBC CS undergraduate machines: % ~cs322/cilog/cilog Or from within SWI Prolog: ?- [cilog_swi]. CILOG Version Copyright 1998, David Poole. CILOG comes with absolutely no warranty. All inputs end with a period. Type "help." for help. cilog:

Is the representation sufficient? What was left out? How about relationships like connected(l2, w4) Or between(s3, l2, outside_power) How do you know when you’ve got it right?

Starting on Wednesday... We’ll be talking about the CILOG RRS in much more detail

Things to do Start reading Chapter 2. Read it carefully. Read it again. Read it with CILOG running in front of you. Run all the examples while you’re reading. Then go back and read it again.