Knowledge-based and Expert Systems - 1. Knowledge-based and Expert Systems - 2. Knowledge-based and Expert Systems - 4

Similar documents
Logic. Knowledge Representation & Reasoning Mechanisms. Logic. Propositional Logic Predicate Logic (predicate Calculus) Automated Reasoning

Deliberative Agents Knowledge Representation I. Deliberative Agents

CS 2710 Foundations of AI Lecture 12. Propositional logic. Logical inference problem

Logical Inference. Artificial Intelligence. Topic 12. Reading: Russell and Norvig, Chapter 7, Section 5

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Propositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Advanced Topics in LP and FP

Expert Systems! Knowledge Based Systems!

Rule-Based Classifiers

Expert Systems! Knowledge Based Systems!

AI Programming CS S-09 Knowledge Representation

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Artificial Intelligence Chapter 7: Logical Agents

Propositional Logic. Logic. Propositional Logic Syntax. Propositional Logic

Deductive and Inductive Logic

Warm-Up Problem. Write a Resolution Proof for. Res 1/32

Problem Solving and Inferencing REASONING AND INFERENCE Characteristics of Classification Type

Proof Techniques (Review of Math 271)

A Quick Lesson on Negation

Propositional Logic Arguments (5A) Young W. Lim 11/30/16

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

INF5390 Kunstig intelligens. Logical Agents. Roar Fjellheim

Bayesian Reasoning. Adapted from slides by Tim Finin and Marie desjardins.

Franz J. Kurfess Computer Science Department California Polytechnic State University San Luis Obispo, CA, U.S.A.

Argument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.

7. Logical Agents. COMP9414/ 9814/ 3411: Artificial Intelligence. Outline. Knowledge base. Models and Planning. Russell & Norvig, Chapter 7.

Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.

Intelligent Agents. Pınar Yolum Utrecht University

Abductive Case Based Reasoning

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

Propositional Logic: Review

Lecture 5 : Proofs DRAFT

CSC242: Intro to AI. Lecture 11. Tuesday, February 26, 13

Logical Agents. September 14, 2004

Propositional Logic Arguments (5A) Young W. Lim 11/8/16

CS 380: ARTIFICIAL INTELLIGENCE

How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.

Logic for Computer Science - Week 4 Natural Deduction

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

Propositional Logic: Bottom-Up Proofs

Bayesian belief networks

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning

Logical agents. Chapter 7. Chapter 7 1

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

Inf2D 13: Resolution-Based Inference

Inference in first-order logic. Production systems.

CITS2211 Discrete Structures Proofs

CS 380: ARTIFICIAL INTELLIGENCE PREDICATE LOGICS. Santiago Ontañón

Inference and Proofs (1.6 & 1.7)

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Rules Build Arguments Rules Building Arguments

CS 771 Artificial Intelligence. Propositional Logic

Concept 1.3: Scientists use two main forms of inquiry in their study of nature

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008

Proof Methods for Propositional Logic

cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

MAI0203 Lecture 7: Inference and Predicate Calculus

Propositional Logic Arguments (5A) Young W. Lim 2/23/17

Guest Speaker. CS 416 Artificial Intelligence. First-order logic. Diagnostic Rules. Causal Rules. Causal Rules. Page 1

Propositional Logic Arguments (5A) Young W. Lim 10/11/16

Propositional and Predicate Logic - V

Logic is the anatomy of thought. John Locke

Logical Agents (I) Instructor: Tsung-Che Chiang

Propositional Logic Arguments (5A) Young W. Lim 11/29/16

Lecture 11: Measuring the Complexity of Proofs

Inference Methods In Propositional Logic

EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS

Strong AI vs. Weak AI Automated Reasoning

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

- a reversed conditional; if a conditional is p q, than its converse is q p

Logic - recap. So far, we have seen that: Logic is a language which can be used to describe:

Propositional Calculus - Hilbert system H Moonzoo Kim CS Dept. KAIST

Chapter 3. The Logic of Quantified Statements

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Logical Agents. Chapter 7

COMP Intro to Logic for Computer Scientists. Lecture 6

Revised by Hankui Zhuo, March 21, Logical agents. Chapter 7. Chapter 7 1

PROOFS IN MATHEMATICS

Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask

Logical Agent & Propositional Logic

Propositional Logic: Part II - Syntax & Proofs 0-0

Propositional Logic. Spring Propositional Logic Spring / 32

Inference Methods In Propositional Logic

Last Time. Inference Rules

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

Logic, Human Logic, and Propositional Logic. Human Logic. Fragments of Information. Conclusions. Foundations of Semantics LING 130 James Pustejovsky

Logical Agent & Propositional Logic

Title: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5)

Predicate Logic. Andreas Klappenecker

Computational Intelligence Lecture 13:Fuzzy Logic

Learning Goals of CS245 Logic and Computation

CSCI 5582 Artificial Intelligence. Today 9/28. Knowledge Representation. Lecture 9

CS 7180: Behavioral Modeling and Decision- making in AI

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

Transcription:

Knowledge-based and Expert Systems - 1 Knowledge-based and Expert Systems - 2 Expert systems (ES) provide expert quality advice, diagnosis or recommendations. ES solve real problems which normally would require a human expert. Two basic steps in building an expert system: 1. Extracting the relevant knowledge from the human expert by a knowledge engineer. 2. S/he then develops the knowledge base of the ES. n example situation using an ES in diagnosing rare diseases. Knowledge acquisition generally involve interviewing the expert. n ES should be 1. easily inspected and modified 2. able to explain its reasoning 1 2 Knowledge-based and Expert Systems - 3 Knowledge-based and Expert Systems - 4 General architecture of expert system: The User Interface user User interface Explanation system Inference Engine Problem-specific Data 1. Enable the system to pose questions to the users 2. Provide explanations about why a particular question is asked 3. llow user queries 4. Displaying the derived results 3 4 Knowledge-based and Expert Systems - 5 Knowledge-based and Expert Systems - 6 The Problem-Specific Inference Engine 1. ll info about the current problem. 1. Interpreter of the knowledge stored in the knowlede base. 2. ll conclusion that the system has been able to derive. 2. Find connections between the problem features and solutions. The The Explanation Facilities 1. Contains all of the relevant, domain-specific, problem-solving knowledge. 2. Two perspecitves: Nature and Format 1. Justify why a question was asked and how it reached some conclusion. 5 6

Logical Inferences Logical Inferences Modus Ponens The process of reasoning involves making inferences from known facts. Given a set of premises known (or thought to be true) and a reasoning method, certain conclusions can be inferred to also be true. The best known of these is modus ponens If statements p and (p q) are known to be true, then we can infer that q is true. The basis for rule-based reasoning Making inferences involves the derivation of new facts from a set of true facts. Predicate logic provides a set of sound rules of inference with which we can perform logical inferences. Example: If someone has flu then he has high temperature (has_flu() high_temperature()) 7 8 Logical Inferences Modus Ponens Logical Inferences Modus Tolens If the statement has_flu(peter) is found in the database, Then through modus ponens, we can infer If the statement (p q) is known to be true, and q is false, then p is false. If the relationship (has_flu() high_temperature()) is true and if peter has no high temperature, then he doesn t have flu. That is if high_temperature(peter) high_temperature(peter) which implies, through modus tolens, has_flu(peter) 9 10 Deduction - 1 Deduction - 2 The Oxford dictionary defines deduction as the process of using information you have in order to understand a particular situation or to find the answer to a problem For example, IF Object is larger than Object ND Object is larger than Object C THEN Object is larger than Object C Logically correct inference, i.e deduction from true premises is guaranteed to result in true conclusions. In predicate logic, this is represented as The most accepted, understood method. C (larger(,) larger(,c) larger(,c)) The basis of both propositional and predicate logics. 11 12

Deduction - 3 bduction - 1 If the following axioms exist: larger(house, car) larger(car, cat) The reasoning method commonly used for generating explanations. Unlike deduction, it does not guarantee a true conclusion. Through deductive reasoning can be derived. larger(house,cat) While abductive inference is unsound, it is a quite useful technique and we use it often in our daily lives. ssuming the following rule (has_flu() high_temperature()) 13 14 bduction - 2 bduction - 3 ssuming the following axiom exists Given the following: high_temperature(john) bduction concludes has_flu(john) ( ) is true bduction allows us to say There could be other reasons why john has high temperature. is possibly true 15 16 Induction - 1 Induction - 2 Reasoning from particular facts or individual cases to a general conclusion. The basis of scientific discovery. The most common form is: P() is true P() is true Then by induction we conclude Observing john over a period of time and noted that whenever he had high temperature, it turned out that he had flu. One could induce that, high_temperature() has_flu() Obviously this is not always true., P() is true. 17 18

Inferences in Rule-based Systems - 1 Inferences in Rule-based Systems - 2 In rule-based ES Domain knowledge is represented as IF- THEN rules. Data are facts about the current situation. Fact: is x Fact: is y Knowledge base Rule: IF is x THEN is y E D Inference Chain Z Rule 1: IF ND THEN Rule 2: IF ND ND THEN Rule 3: IF THEN D Z E 19 20 Rule 1: Rule 2: Rule 3: Rule 4: Rule 5: & D Z & & E C L L & M N Reasoning starts from data and proceeds forward with that data. Each time only the top most rule is executed. When fired, the rule addes a new fact in the database. ny rule can be executed only once. The match-fire cycle stops when no further rule can be fired. 21 22 Cycle 1 L Cycle 1 23 24

L Cycle 2 L Z Cycle 3 25 26 The ES has the goal (a hypothetical solution) and the inference engine attempts to prove it. Find rules that might have the desired solution in the THEN parts. Subgoal(s) might be needed in proving the IF parts Search rules that can prove the subgoals. Z Pass 1 The process repeats. Goal: Z 27 28? Pass 2? Pass 3 Sub -goal: Sub-goal: 29 30

Sub-goal: Pass 4 Sub-goal: Pass 5 31 32 Forward or ackward? Forward Chaining for analysis and interpretation. Goal: Z Z Pass 6 For example, DENDRL determines the molecular structure of unknown soil based on its mass spectral data. ackward Chaining for diagnosis For example, MCIN diagnoses infectious blood diseases. Combining forward and backward chaining? 33 34 Readings 1. P.47 78 of Luger (2002) 2. P.247 267 of Luger (2002) 3. Section 5.1 5.6 of Negnevitsky, M. (2002) rtificial Intelligence, Guide to Intelligent Systems. ddison Wesley. On Frame-based Expert Systems (Essential Reading) 4. Section 3.1 3.5 of Negnevitsky, M. (2002) rtificial Intelligence, Guide to Intelligent Systems. ddison Wesley. On Handling Uncertainty in Rule-based Expert Systems (Highly Recommended Reading) 35