ENGS4 2004 Lecture 5 ENGS 4 - Lecture 5 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko,

Slides:



Advertisements
Similar presentations
Geometry Chapter 2 Terms.
Advertisements

Geometry 2.3 Big Idea: Use Deductive Reasoning
Expert Systems Reasonable Reasoning An Ad Hoc approach.
1 Inferences with Uncertainty Decision Support Systems and Intelligent Systems, Efraim Turban and Jay E. Aronson Copyright 1998, Prentice Hall, Upper Saddle.
Expert Systems Reasonable Reasoning An Ad Hoc approach.
Argumentation Logics Lecture 5: Argumentation with structured arguments (1) argument structure Henry Prakken Chongqing June 2, 2010.
CS 484 – Artificial Intelligence1 Announcements Choose Research Topic by today Project 1 is due Thursday, October 11 Midterm is Thursday, October 18 Book.
What is motion? An object is in motion if it changes position over time compared to a reference point.
ENGS Lecture 3 ENGS 4 - Lecture 3 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko,
Chapter 11 Artificial Intelligence and Expert Systems.
ENGS Lecture 8 ENGS 4 - Lecture 8 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko,
Cooperating Intelligent Systems Course review AIMA.
ENGS Lecture 4 ENGS 4 - Lecture 4 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko,
ENGS Assignment 2 ENGS 4 - Lecture 8 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Assignment 2 – Due Friday,
ENGS Lecture 6 ENGS 4 - Lecture 6 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko,
1 Chapter 9 Rules and Expert Systems. 2 Chapter 9 Contents (1) l Rules for Knowledge Representation l Rule Based Production Systems l Forward Chaining.
ENGS Lecture 7 ENGS 4 - Lecture 7 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko,
EXPERT SYSTEMS Part I.
ENGS Lecture 1 ENGS 4 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko, x6-3843
MSIS 110: Introduction to Computers; Instructor: S. Mathiyalakan1 Specialized Business Information Systems Chapter 11.
Chapter 3: Methods of Inference Expert Systems: Principles and Programming, Fourth Edition.
Chapter 2: Geometric Reasoning
Sepandar Sepehr McMaster University November 2008
ENGS Lecture 1 ENGS 4 - Lecture 11 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko,
4x + 2y = 18 a. (1,8) = 18 a. 4(1) + 2(8) = 18 b. (3,3)20 = 18 b. 4(3) + 2(3) = = = 18 15x + 5y = 5 a. (-2,7) NoYes b. (-1,4) a.
Artificial Intelligence Lecture No. 15 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Previous Year Exam Questions Topic: Expert Systems and Rule-based Reasoning.
13: Inference Techniques
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
Explanation Facility دكترمحسن كاهاني
School of Computer Science and Technology, Tianjin University
Steps to the Scientific Method. Scientific Method Steps: At the conclusion of our time together, you should be able to: 1. List the 6 steps of the scientific.
Principles of Information Systems, Sixth Edition Specialized Business Information Systems Chapter 11.
Applying Deductive Reasoning Section 2.3. Essential Question How do you construct a logical argument?
Deductive Reasoning Chapter 2 Lesson 4.
Chapter 2 Lesson 3 Objective: To use the Law of Detachment and the Law of Syllogism.
Question of the Day!  We shared a lot of examples of illogical arguments!  But how do you make a LOGICAL argument? What does your argument need? What.
Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.
From conclusions by applying the laws of logic. Symbolic Notation Conditional statement If p, then qp ⟶q Converseq⟶p Biconditional p ⟷ q.
LOGICAL REASONING FOR CAT 2009.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
KNOWLEDGE BASED SYSTEMS
CSCI N241: Fundamentals of Web Development Copyright ©2006  Department of Computer & Information Science Navigation, Links & Images.
1 Knowledge Based Systems (CM0377) Introductory lecture (Last revised 28th January 2002)
Computing & Information Sciences Kansas State University Monday, 23 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 25 of 42 Monday, 23 October.
Computing & Information Sciences Kansas State University Friday, 20 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 24 of 42 Friday, 20 October.
Questions for Today 1.What is the Nature of Science? 2.What are the differences between a theory and a law? 3.What are the differences between inductive.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
CMPT 308 — Computability and Complexity Fall 2004 Instructor: Andrei Bulatov, TA: Ramsay Dyer, Learning.
Browser. What parts does the browser consist of? Title bar Menu bar Toolbar Address box Links.
ITEC 1010 Information and Organizations Chapter V Expert Systems.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
1 Introduction to Artificial Intelligence CSE 415 Winter 2006.
1 Ch 17: Alternative Decision-Support Systems. 2 What is an expert system? ‘The modeling, within a computer, of expert knowledge in a given domain, such.
1 Chapter 13 Artificial Intelligence and Expert Systems.
Representation and Search The function of a representation is to capture the critical features of the problem domain –and make the information accessible.
The Scientific Method. How can we ask questions about functions, interaction, etc.? The Scientific Method – Process of inquiry Discovery Science – Descriptive.
By Muhammad Safdar MCS [E-Section].  There are times in life when you are faced with challenging decisions to make. You have rules to follow and general.
Deductive Reasoning. Warm-up Objectives: 1) To use the Law of Detachment 2) To use the Law of Syllogism.
Chapter 3: Methods of Inference
Chapter 9. Rules and Expert Systems
Chapter 3: Methods of Inference
M1 Lesson 4.4 January 21, 2009 Deductive Reasoning.
Earlier we learned about inductive reasoning. • Earlier we learned about inductive reasoning. • Look at specific examples. • Recognize patterns, which.
2.4 Deductive Reasoning.
2-3 Deductive Reasoning Objectives:
Chapter 2: Geometric Reasoning
2-4 Deductive Reasoning Vocab:
Presentation transcript:

ENGS Lecture 5 ENGS 4 - Lecture 5 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Instructor: George Cybenko, x Assistant: Sharon Cooper (“Shay”), x Course webpage:

ENGS Lecture 5 Today’s Class Chad’s presentation Discuss Assignment (due today) Images in web pages and links Break Mini-lecture “Predicting the Future” theme Logical reasoning in expert systems –decision trees, forward and backward chaining Applications of rule-based systems

ENGS Lecture 5 Chad Part II

ENGS Lecture 5 HW Questions?

ENGS Lecture 5 Images in web pages Absolute vs relative addresses Copyright issues Background – images/patterns and colors

ENGS Lecture 5 Break

ENGS Lecture 5 Mini-lecture or open mic

ENGS Lecture 5 “Predicting the Future” Technologies for predicting the future Start with methods based on Aristotelian logic Rule-based, expert systems, etc.

ENGS Lecture 5 Reasoning in rule-based systems Decision trees –diagnosis, troubleshooting, etc –answer to a question leads to another question –displayed graphically, resembles a tree fever? rash?vomiting? yes noyes no

ENGS Lecture 5 Reasoning in rule-based systems Theorem proving (forward chaining) –start with true predicates and rules and conclusion you want to “prove”, say Z –repeatedly apply deduction, syllogism –example: A, B, C, D, E true “rules” –If (A and B) then H –If (D or H) then J –If (J and C) then V –If ( ) then Z –stop when conclusion is found to be true

ENGS Lecture 5 Reasoning in rule-based systems Theorem proving (backward chaining) –start with true predicates and rules and conclusion you want to “prove”, say Z –working backwards from Z, keep track of what predicates have to be true for Z to be true –when all such predicates are known to be true, stop –Example: Z is “Smith murdered Jones” –if ((x has a motive) and (x had the means) and (x can be placed at the scene)) then (x murdered Jones)

ENGS Lecture 5

Aristotelian Science “Women have fewer teeth than men” Law: civil and religious Physics Crisis: Rules cannot explain the physical world. Why do all objects irrespective of mass fall at the same rate? Galileo. Why do things fall? Newton. Hilbert’s program (1900), Gödel’s incompleteness results (1931)

ENGS Lecture 5 Applications Accounting Financial Advising Medical Diagnosis Ancient Astronomy Maintenance (troubleshooting) Others….