0% found this document useful (0 votes)
57 views

AI Chapter 1 - Introduction

This document discusses the history and approaches of artificial intelligence including symbolic and subsymbolic processing. It covers topics such as logic-based and emergent behavior-based AI, neural networks, evolution systems, and important AI milestones and examples ranging from the 1940s to recent successes like Deep Blue.

Uploaded by

Ransford Oppong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
57 views

AI Chapter 1 - Introduction

This document discusses the history and approaches of artificial intelligence including symbolic and subsymbolic processing. It covers topics such as logic-based and emergent behavior-based AI, neural networks, evolution systems, and important AI milestones and examples ranging from the 1940s to recent successes like Deep Blue.

Uploaded by

Ransford Oppong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

Artificial Intelligence

Chapter 1
Introduction

Biointelligence Lab
School of Computer Sci. & Eng.
Seoul National University
1.1 What Is AI? (1)
l Artificial Intelligence (AI)
¨ Intelligent behavior in artifacts
¨ “Designing computer programs to make computers smarter”
¨ “Study of how to make computers do things at which, at the
meoment, people are better”
l Intelligent behavior
¨ Perception, reasoning, learning, communicating, acting in
complex environments
l Long term goals of AI
¨ Develop machines that do things as well as humans can or
possibly even better
¨ Understand behaviors

(C) 2000-2002 SNU CSE Biointelligence Lab 2


1.1 What Is AI? (2)
l Can machines think?
¨ Depend on the definitions of “machine”, “think”, “can”
l “Can”
¨ Can machines think now or someday?
¨ Might machines be able to think theoretically or actually?
l “Machine”
¨ E6 Bacteriophage: Machine made of proteins
¨ Searle’s belief
< What we are made of is fundamental to our intelligence
< Thinking can occur only in very special machines – living ones
made of proteins

(C) 2000-2002 SNU CSE Biointelligence Lab 3


1.1 What Is AI? (3)

Figure 1.1 Schematic Illustration of E6 Bacteriophage

(C) 2000-2002 SNU CSE Biointelligence Lab 4


1.1 What Is AI? (4)
l “Think”
¨ Turing test: Decide whether a machine is intelligent or not
< Interrogator (C): determine man/woman
< A: try and cause C to make the wrong identification
< B: help the interrogator

¨ Examples: ELIZA [Weizenbaum], JULIA [Mauldin]

Room1 Room2
teletype
Man (A), Woman (B) Interrogator (C)

(C) 2000-2002 SNU CSE Biointelligence Lab 5


학습 알고리즘
[Zhang 98]
추론 메커니즘
연구분야 지식 표현 방식
지능 시스템 구조

지능형 에이전트
정보검색
데이터마이닝
인공지능 응용분야 전문가 시스템
지능형 로봇
자연언어 처리

합리론적(논리기호)
경험론적(확률통계)
접근방법 연결론적(신경소자)
진화론적(유전 진화)
생물학적(인공생명)
(C) 2000-2002 SNU CSE Biointelligence Lab 6
1.2 Approaches to AI (1)
l Two main approaches: symbolic vs. subsymbolic
1. Symbolic
¨ Classical AI (“Good-Old-Fashioned AI” or GOFAI)
¨ Physical symbol system hypothesis
¨ Logical, top-down, designed behavior, knowledge-intensive
2. Subsymbolic
¨ Modern AI, neural networks, evolutionary machines
¨ Intelligent behavior is the result of subsymbolic processing
¨ Biological, bottom-up, emergent behavior, learning-based
l Brain vs. Computer
¨ Brain: parallel processing, fuzzy logic
¨ Computer: serial processing, binary logic
(C) 2000-2002 SNU CSE Biointelligence Lab 7
1.2 Approaches to AI (1)

l Symbolic processing approaches


¨ Physical symbol system hypothesis [Newell & Simon]
< “A physical symbol system has the necessary and sufficient
means for general intelligence action”
< Physical symbol system: A machine (digital computer) that can
manipulate symbolic data, rearrange lists of symbols, replace
some symbols, and so on.
¨ Logical operations: McCarthy’s “advice-taker”
< Represent “knowledge” about a problem domain by declarative
sentences based on sentences in first-order logic
< Logical reasoning to deduce consequences of knowledge
< applied to declarative knowledge bases

(C) 2000-2002 SNU CSE Biointelligence Lab 8


1.2 Approaches to AI (2)
¨ Top-down design method
< Knowledge level
– Top level
– The knowledge needed by the machine is specified
< Symbol level
– Represent knowledge in symbolic structures (lists)
– Specify operations on the structures
< Implementation level
– Actually implement symbol-processing operations

(C) 2000-2002 SNU CSE Biointelligence Lab 9


1.2 Approaches to AI (3)
l Subsymbolic processing approaches
¨ Bottom-up style
< The concept of signal is appropriate at the lowest level
¨ Animat approach
< Human intelligence evolved only after a billion or more years of
life on earth
< Many of the same evolutionary steps need to make intelligence
machines
¨ Symbol grounding
< Agent’sbehaviors interact with the environment to produce
complex behavior
¨ Emergent behavior
< Functionality of an agent: emergent property of the intensive
interaction of the system with its dynamic environment
(C) 2000-2002 SNU CSE Biointelligence Lab 10
1.2 Approaches to AI (4)
¨ Well-known examples of machines coming from the
subsymbolic school
< Neural networks
– Inspired by biological models
– Ability to learn
< Evolution systems
– Crossover, mutation, fitness
< Situated automata
– Intermediate between the top-down and bottom-up approaches

(C) 2000-2002 SNU CSE Biointelligence Lab 11


1.3 Brief History of AI (1)
[Zhang 98]
Symbolic AI Biological AI

l 1943: Production rules l 1943: McCulloch-Pitt’s neurons


l 1956: “Artificial Intelligence” l 1959: Perceptron
l 1958: LISP AI language l 1965: Cybernetics
l 1965: Resolution theorem l 1966: Simulated evolution
proving l 1966: Self-reproducing automata

l 1970: PROLOG language l 1975: Genetic algorithm


l 1971: STRIPS planner
l 1973: MYCIN expert system l 1982: Neural networks
l 1982-92: Fifth generation computer l 1986: Connectionism
systems project l 1987: Artificial life
l 1986: Society of mind
l 1992: Genetic programming
l 1994: Intelligent agents l 1994: DNA computing
(C) 2000-2002 SNU CSE Biointelligence Lab 12
1.3 Brief History of AI (2)
l 1940~1950
¨ Programs that perform elementary reasoning tasks
¨ Alan Turing: First modern article dealing with the possibility of
mechanizing human-style intelligence
¨ McCulloch and Pitts: Show that it is possible to compute any
computable function by networks of artificial neurons.
l 1956
¨ Coined the name “Artificial Intelligence”
¨ Frege: Predicate calculus = Begriffsschrift = “concept writing”
¨ McCarthy: Predicate calculus: language for representing and
using knowledge in a system called “advice taker”
¨ Perceptron for learning and for pattern recognition [Rosenblatt]

(C) 2000-2002 SNU CSE Biointelligence Lab 13


1.3 Brief History of AI (3)
l 1960~1970
¨ Problem representations, search techniques, and general
heuristics
¨ Simple puzzle solving, game playing, and information
retrieval
¨ Chess, Checkers, Theorem proving in plane geometry
¨ GPS (General Problem Solver)

(C) 2000-2002 SNU CSE Biointelligence Lab 14


1.3 Brief History of AI (4)

l Late 1970 ~ early 1980


¨ Development of more capable programs that contained the
knowledge required to mimic expert human performance
¨ Methods of representing problem-specific knowledge
¨ DENDRAL
< Input:
chemical formula, mass spectrogram analyses
< Output: predicting the structure of organic molecules

¨ Expert Systems
< Medical diagnoses

(C) 2000-2002 SNU CSE Biointelligence Lab 15


1.3 Brief History of AI (5)

l DEEP BLUE (1997/5/11)


¨ Chess game playing program
l Human Intelligence
¨ Ability to perceive/analyze a visual scene
< Roberts

¨ Ability to understand and generate language


< Winograd: Natural Language understanding system
< LUNAR system: answer spoken English questions about rock
samples collected from the moon

(C) 2000-2002 SNU CSE Biointelligence Lab 16


1.3 Brief History of AI (6)
l Neural Networks
¨ Late 1950s: Rosenblatt
¨ 1980s: important class of nonlinear modeling tools
l AI research
¨ Neural networks + animat approach: problems of connecting
symbolic processes to the sensors and efforts of robots in
physical environments
l Robots and Softbots (Agents)

(C) 2000-2002 SNU CSE Biointelligence Lab 17


1.4 Plan of the Book
l Agent in grid-space world
l Grid-space world
¨ 3-dimensional space demarcated by a 2-dimensional grid of
cells “floor”
l Reactive agents
¨ Sense their worlds and act in them
¨ Ability to remember properties and to store internal models of
the world
¨ Actions of reactive agents: f(current and past states of their
worlds)

(C) 2000-2002 SNU CSE Biointelligence Lab 18


Figure 1.2 Grid-Space World
(C) 2000-2002 SNU CSE Biointelligence Lab 19
1.4 Plan of the Book
l Model
¨ Symbolic structures and set of computations on the structures
¨ Iconic model
< Involve data structures, computations
< Iconic chess model: complete
< Feature based model
– Use declarative descriptions of the environment
– Incomplete

(C) 2000-2002 SNU CSE Biointelligence Lab 20


1.4 Plan of the Book
l Agents can make plans
¨ Have the ability to anticipate the effects of their actions
¨ Take actions that are expected to lead toward their goals
l Agents are able to reason
¨ Can deduce properties of their worlds
l Agents co-exist with other agents
¨ Communication is an important action

(C) 2000-2002 SNU CSE Biointelligence Lab 21


1.4 Plan of the Book
l Autonomy
¨ Learning is an important part of autonomy
¨ Extent of autonomy
< Extent that system’s behavior is determined by its immediate
inputs and past experience, rather than by its designer’s.
¨ Truly autonomous system
< Should be able to operate successfully in any environment, given
sufficient time to adapt

(C) 2000-2002 SNU CSE Biointelligence Lab 22

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy