1 / 12

CSE 415 Introduction to Artificial Intelligence Spring 2001

CSE 415 Introduction to Artificial Intelligence Spring 2001. Instructor: Steve Tanimoto email: tanimoto@cs.washington.edu Teaching assistants: Jayant Madhavan, email: jayant@cs.washington.edu David Azari, email: azari@cs.washington.edu.

grant-miles
Download Presentation

CSE 415 Introduction to Artificial Intelligence Spring 2001

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSE 415 Introduction to Artificial IntelligenceSpring 2001 Instructor: Steve Tanimoto email:tanimoto@cs.washington.edu Teaching assistants: Jayant Madhavan, email:jayant@cs.washington.edu David Azari, email:azari@cs.washington.edu Purpose: To learn fundamental techniques of artificial intelligence, including symbolic programming, knowledge representation, search, inference, learning, and computer understanding of language and images. CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  2. Why Study Artificial Intelligence? Gain insight into human intelligence by considering computational models of intelligence. Gain the ability to create programs that perform functions normally thought to require intelligence. Improve our own problem-solving skills by taking to heart lessons learned in AI. Find solutions to specific modern problems such as dealing with information overload, providing online services in medicine, education, etc. Work with neat technology. CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  3. Major Topics to be Covered • Lisp programming:Symbolic Computation • Knowledge representation:Relations, logic • Inference:Logical, case-based, probabilistic • Communication:Learning, understanding language and visual images. CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  4. Detailed Topics with Lisp • Interactive programming • S-expressions, atomic datatypes, lists, functional forms, special forms, macro forms. • Defining functions, recursive functions. • Scope and extent of bindings. • Evaluation of forms. • Functions as first-class objects, closures • Defining macros • Pattern matching • Web-based interaction CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  5. Detailed Topics withinKnowledge Representation • Relationships among data, information, and knowledge • ISA hierarchies • Propositional logic and resolution • Other inference methods • Predicate logic and encoding methods • Resolution in the predicate calculus • Logic programming CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  6. Detailed Topics within Search • Formal description of state-space search • Recursive backtracking depth-first search • Breadth-first, best-first, iterative-deepening, uniform-cost, and A* search. • Genetic search CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  7. Other Topics • Probabilistic reasoning • Learning • Natural language understanding • Vision • Neural Nets CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  8. Textbook • Steven Tanimoto: The Elements of Artificial Intelligence: An Introduction to Common Lisp, 2d ed. New York: W. H. Freeman, 1995. CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  9. Evaluation • Assignments 50%. • Quiz 1: 10% • Quiz 2. 10%. • Final exam 30%. CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  10. What is Intelligence? • Is it a quantity of information? • Is it speed of processing? • Are any computers intelligent? • Are all people intelligent? • Why is artificial intelligence covered in a separate course in the curriculum? CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  11. How Can We Determine Whether A Computer is Intelligent? • Measure its knowledge? Count bytes of knowledge? Count the number of its rules? Words in its vocabulary? Functions in its library? • Measure processing speed? Logical inferences per second? Rule applications per second? Associations per second? • Compare it with a person in a blind test? CSE 415 -- (c) S. Tanimoto, 2001 Introduction

  12. Turing’s Test • A computer (program) and a person compete by trying to answer questions intelligently. Randomly, one is assigned the name A and the other B. • In another room, a human interrogator alternately poses questions to A and B. • A messenger (an “intermediary”) delivers questions and responses without revealing any other information about the identities of A and B. • If the interrogator selects the computer as the more human or more intelligent respondent, then the computer passes that particular Turing Test. CSE 415 -- (c) S. Tanimoto, 2001 Introduction

More Related