CMPB454 ARTIFICIAL INTELLIGENCE (AI) CHAPTER 1.1 Background Information CHAPTER 1.1 Background Information Instructor: Alicia Tang Y. C.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Relational Algebra Chapter 4, Part A.
Knowledge Representation
Chapter 6: The physical symbol system hypothesis
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Problem Solving and Search in AI Part I Search and Intelligence Search is one of the most powerful approaches to problem solving in AI Search is a universal.
Chapter 1: Preliminaries
1946: ENIAC heralds the dawn of Computing. I propose to consider the question: “Can machines think?” --Alan Turing, : Turing asks the question….
Chapter 11 Artificial Intelligence and Expert Systems.
Artificial Intelligence
ISBN Chapter 1 Preliminaries. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.1-2 Chapter 1 Topics Motivation Programming Domains.
Creating Architectural Descriptions. Outline Standardizing architectural descriptions: The IEEE has published, “Recommended Practice for Architectural.
CPSC 322 Introduction to Artificial Intelligence September 8, 2004.
Chapter 12: Intelligent Systems in Business
Describing Syntax and Semantics
CSNB234 ARTIFICIAL INTELLIGENCE Background & History of AI
ISBN Chapter 1 Topics Motivation Programming Domains Language Evaluation Criteria Influences on Language Design Language Categories Language.
RESEARCH DESIGN.
Intelligence & Artificial Intelligence You must have a pre-prepared sentence or two to spout about what is a description of intelligence.. And what is.
Research Methods in Nursing. Examining History 1600’s is the age of reasoning; finding reason and experimenting what is observed. Isaac Newton is a pioneer.
Computer Architecture Computational Models Ola Flygt V ä xj ö University
CSCI 4410 Introduction to Artificial Intelligence.
Artificial Intelligence CIS 479/579 Bruce R. Maxim UM-Dearborn.
Introduction to Artificial Intelligence Artificial Intelligence Section 4 Mr. Sciame.
Artificial Intelligence: Its Roots and Scope
Knowledge representation
Some Thoughts to Consider 1 What is so ‘artificial’ about Artificial Intelligence? Just what are ‘Knowledge Based Systems’ anyway? Why would we ever want.
11 C H A P T E R Artificial Intelligence and Expert Systems.
A RTIFICIAL I NTELLIGENCE Introduction 3 October
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
Copyright © 2006, The McGraw-Hill Companies, Inc. All rights reserved. Decision Support Systems Chapter 10.
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages.
1 Artificial Intelligence GholamReza GhassemSani Fall 1383.
Cognitive Psychology: Thinking, Intelligence, and Language
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
ARTIFICIAL INTELLIGENCE DR. ABRAHAM AI a field of computer science that is concerned with mechanizing things people do that require intelligent.
Types of Artificial Intelligence & Pioneers in the Field By Vernon Crowder.
1 Introduction to Artificial Intelligence (Lecture 1)
ARTIFICIAL INTELLIGENCE Human like intelligence Definitions: 1. Focus on intelligent Behaviour “Behaviour by a machine that, if performed by a human.
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
Course Instructor: K ashif I hsan 1. Chapter # 1 Kashif Ihsan, Lecturer CS, MIHE2.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Logical and Functional Programming
Introduction to Artificial Intelligence CS 438 Spring 2008.
Research Methodology For Information Technology Students [cf. Martin Olivier 1997] Created by Piet Boonzaier Chapter 2 Designing your project.
By: Nelson Webster. Algorithm Engineers Algorithm engineers study the effectiveness and efficiency of procedures of solving problems on a computer.
Artificial Intelligence Chapter 1 - Part 2 Artificial Intelligence (605451) Dr.Hassan Al-Tarawneh.
Presented by:- Reema Tariq Artificial Intelligence.
1 ARTIFICIAL INTELLIGENCE Gilles BÉZARD Version 3.16.
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.
16 April 2011 Alan, Edison, etc, Saturday.. Knowledge, Planning and Robotics 1.Knowledge 2.Types of knowledge 3.Representation of knowledge 4.Planning.
1 Solving Problems with Methods Questions. 2 Problem solving is a process similar to working your way through a maze. But what are these “steps” and what.
Decision Support and Business Intelligence Systems (9 th Ed., Prentice Hall) Chapter 12: Artificial Intelligence and Expert Systems.
Artificial Intelligence
Concepts of Programming Languages
PROGRAMMING LANGUAGES
Lecture #1 Introduction
CHAPTER 1 Introduction BIC 3337 EXPERT SYSTEM.
Introduction Characteristics Advantages Limitations
Artificial Intelligence
Knowledge Representation
Introduction Artificial Intelligent.
Artificial Intelligence (Lecture 1)
Chapter 1 Preliminary. Chapter 1 Preliminary 1.1 Reasons for Studying Concepts of Programming Languages Increased capacity to express ideas Improved.
KNOWLEDGE REPRESENTATION
전문가 시스템(Expert Systems)
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Presentation transcript:

CMPB454 ARTIFICIAL INTELLIGENCE (AI) CHAPTER 1.1 Background Information CHAPTER 1.1 Background Information Instructor: Alicia Tang Y. C.

AI : INTRODUCTORY LESSON u What Is Natural Intelligence? u What Is IQ? u What Is Artificial Intelligence? u What Machine Is Good At?

IQ of a person Mental Age IQ = * 100 Chronological Age E.g. if a 20 years old person undergoes IQ test and the examiner determines his mental age as 18, hen his IQ is > below average! Younger candidate case: 20/10 * 100 = 200 point

AI can be defined as the attempt to get real machines to behave like the ones in the movies.

AI : INTRODUCTORY LESSON u Heuristics Vs. Algorithmic. Logic u What Is Logic? u ______ + ________ = Traditional Program u _____ + _____________ = AI Program

AI : INTRODUCTORY LESSON u Father Of Artificial Intelligence – ALAN TURING u What is “Turing Test”? u Other Theorists : McDermott, McCarthy, Winston, Rich, Newell, Simon, Rosenblatt, etc.

Alan Turing( )

SYMBOLIC PROCESSING It is a branch of Computer Science that deals with Symbolic, Non Algorithmic methods of problem solving. HEURISTICS It is the branch of Computer Science that deals with ways of representing knowledge using symbols rather than numbers and with rules- of-thumb for processing information.

HEURISTICS PROGRAMMING u HEURISTICS –developed through intuition, experience & judgment. –they do not represent (our) knowledge of design, rather, they represent guidelines through which a system may be operated. –often called ‘Rules of thumb’. u CHARACTERISTICS OF HEURISTICS t Screening FilteringPruning

HEURISTIC PROGRAMMING Should not be confused with computer programming. A program is a solution; programming is a procedure for obtaining a solution. Thus, heuristic programming is a procedure for finding the solution to a model consisting of ‘heuristics’.

u A human would normally take 20 years to acquire an IQ of approximately 120 point, but: –do we give computers a few years or so to gain knowledge (hence intelligence) to attain at the same level of competency? u How does a baby learn? S/he sees, hears, reads, etc. for countless number of times. u Anticipated for  Medical officers to be involved in AI research.… … brain study... Neurophysiology Some Background Study

LANGUAGES FOR AI PROBLEM SOLVING u Two Levels of Abstraction: t Symbol level t Knowledge level u Symbol Level: –Concerns with the particular formalisms used to represent knowledge such as logic or production rules. –Concerns with the structures used to organize knowledge.

u Knowledge Level: t what queries will be made? t how new knowledge could be added? t what objects and relations are necessary? t can the system reasons despite of incompleteness of information?

REQUIREMENTS FOR AI LANGUAGE  Support of Symbolic Computation –implementation of a set of operation on symbolic rather than numeric data. –predicate calculus is a powerful tool for constructing qualitative descriptions of a domain.  Support of Symbolic Computation –implementation of a set of operation on symbolic rather than numeric data. –predicate calculus is a powerful tool for constructing qualitative descriptions of a domain.

u Flexibility of Control –AI cannot be achieved by the step-by- step execution of fixed sequence of instructions. –Production systems being the most important paradigm for building AI program. –Production rules can fire in virtually any order (not step-by-step) in response to a given situation.

 Support of Exploratory Programming Methodologies. –AI programs seldom respond to standard software approaches such as top-down design, stepwise refinement. –This is due to the nature of AI problems that they could be started & tested without having to completely produce the final specification. –In other words, most AI programs are initially poorly specified. –AI programming is inherently exploratory; the program is the vehicle through which we explore the problem area (domain) and discover solution strategies.  Support of Exploratory Programming Methodologies. –AI programs seldom respond to standard software approaches such as top-down design, stepwise refinement. –This is due to the nature of AI problems that they could be started & tested without having to completely produce the final specification. –In other words, most AI programs are initially poorly specified. –AI programming is inherently exploratory; the program is the vehicle through which we explore the problem area (domain) and discover solution strategies.

u Late Binding and Constraint Propagation –Often, the problems addressed by AI program (such as Prolog program) require that the values of certain entities to remain unknown until sufficient information is gathered to determine the assignment. –As constraints are accumulated, the set of possible values is reduced, ultimately converging on a solution.

u Clear and Well-defined Semantics. –This could be achieved by developing new languages that do not (to certain extent) conform to the architecture underlying von Neumann computer and be on the foundation of mathematical formalisms such as logic (Prolog). –Traditional programming languages are too complex in constructs and semantic definitions. They are not subject to self- proof. u Clear and Well-defined Semantics. –This could be achieved by developing new languages that do not (to certain extent) conform to the architecture underlying von Neumann computer and be on the foundation of mathematical formalisms such as logic (Prolog). –Traditional programming languages are too complex in constructs and semantic definitions. They are not subject to self- proof.

AI Systems Development Knowledge and expertise Can be tested (already) This is called __________

There is no MAGIC