Expert systems facts & rules inference engines certainty user interfaces systems structure.

Slides:



Advertisements
Similar presentations
1 Knowledge Based Systems (CM0377) Lecture 11 (Last modified 26th March 2001)
Advertisements

FT228/4 Knowledge Based Decision Support Systems
Inference Rules Universal Instantiation Existential Generalization
Expert Systems Reasonable Reasoning An Ad Hoc approach.
CHAPTER 13 Inference Techniques. Reasoning in Artificial Intelligence n Knowledge must be processed (reasoned with) n Computer program accesses knowledge.
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.
Resolving Rule Conflicts Assign explicit priorities to rules Specificity of a rule’s antecedents R1: IF car will not start THEN battery is dead R2: IF.
Uncertainty in Expert Systems (Certainty Factors).
Rulebase Expert System and Uncertainty. Rule-based ES Rules as a knowledge representation technique Type of rules :- relation, recommendation, directive,
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
1 Antecedent-Consequent Rules Rn:IF condition 1 condition 2... THEN consequent 1 consequent 2...
Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
Logic.
CS 484 – Artificial Intelligence1 Announcements Choose Research Topic by today Project 1 is due Thursday, October 11 Midterm is Thursday, October 18 Book.
Inferences The Reasoning Power of Expert Systems.
Conflict Resolution  what to do if there is more than 1 matching rule in each inference cycle? match WM with LHS of rules select one rule (conflict resolution)
B. Ross Cosc 4f79 1 Forward chaining backward chaining systems: take high-level goal, and prove it by reducing it to a null goal - to reduce it to null,
Reasoning System.  Reasoning with rules  Forward chaining  Backward chaining  Rule examples  Fuzzy rule systems  Planning.
Intelligent systems Lecture 6 Rules, Semantic nets.
Knowledge Engineering.  Process of acquiring knowledge from experts and building knowledge base  Narrow perspective  Knowledge acquisition, representation,
Rule Based Systems Michael J. Watts
Artificial Intelligence Lecture No. 16
Chapter 12: Expert Systems Design Examples
Rule Based Systems Alford Academy Business Education and Computing
1 5.0 Expert Systems Outline 5.1 Introduction 5.2 Rules for Knowledge Representation 5.3 Types of rules 5.4 Rule-based systems 5.5 Reasoning approaches.
Lecture 04 Rule Representation
ICT619 Intelligent Systems Topic 2: Expert Systems.
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.
Rules and Expert Systems
© C. Kemke1Reasoning - Introduction COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
EXPERT SYSTEMS Part I.
Artificial Intelligence CSC 361
With Microsoft Excel 2007 Comprehensive 1e© 2008 Pearson Prentice Hall1 PowerPoint Presentation to Accompany GO! with Microsoft ® Excel 2007 Comprehensive.
Wisconsin Farm Animals - Cow - Kyla Hensel Moo Farm Habitat Purpose Fun Fact Home Page.
Presented by Mohammad Saniee December 2, 2003
INTELLIGENT SYSTEMS Rule based systems 1. Aims of session To understand  Basic principles  Forward chaining  Problems with rule-based systems  Backward.
Knowledge based Humans use heuristics a great deal in their problem solving. Of course, if the heuristic does fail, it is necessary for the problem solver.
 Architecture and Description Of Module Architecture and Description Of Module  KNOWLEDGE BASE KNOWLEDGE BASE  PRODUCTION RULES PRODUCTION RULES 
1 CHAPTER 13 Decision Support Systems and Intelligent Systems, Efraim Turban and Jay E. Aronson 6th ed, Copyright 2001, Prentice Hall, Upper Saddle River,
Rule Based Systems  If then  Rules to solve problems  What is forward chaining?  What is backward chaining?  Expert systems.
Software Evaluation in AI. The Selection Problem Recency of products Evolving nature of products Variety of products Lack of standards.
Expert System Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Cougar Time. Adding Negative Numbers  What are the two rules for adding integers?  Same Signs = Add and keep the sign  Different Signs = Find the absolute.
Rules and Expert Systems
Chapter 4: Inference Techniques
Use of Expert Systems for Application Systems Development.
Forward and Backward Chaining
Expert System Seyed Hashem Davarpanah University of Science and Culture.
LOGICMOO INFERENCE ENGINE: Use only “decidable” fragments of Logic. (No false negatives and no false positives) Expect the systems Knowledge of the world.
Knowledge Engineering. Sources of Knowledge - Books - Journals - Manuals - Reports - Films - Databases - Pictures - Audio and Video Tapes - Flow Diagram.
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.
Intelligent Systems Rule based systems 1. Aims of session To understand Basic principles Forward chaining Problems with rule-based systems Backward chaining.
REASONING UNDER UNCERTAINTY: CERTAINTY THEORY
Lecture 20. Recap The main components of an ES are –Knowledge Base (LTM) –Working Memory (STM) –Inference Engine (Reasoning)
Advanced AI Session 2 Rule Based Expert System
Rules: Knowledge Representation & Manipulation
Chapter 9. Rules and Expert Systems
EA C461 – Artificial Intelligence Logical Agent
Preserving and Applying Human Expertise: Knowledge-Based Systems
Fuzzy Logic and Approximate Reasoning
Introduction to Expert Systems Bai Xiao
SISTEM INFORMASI MANAJEMEN 2
CS62S: Expert Systems Based on:
Forward Chaining DFS can supply compatible bindings for forward chaining.
Knowledge Representation and Inference
Chapter 9. Rules and Expert Systems
28th September 2005 Dr Bogdan L. Vrusias
How many groups are there?
Summary of the Rules A>B -A B -(A>B) A -B --A A AvB A B
Presentation transcript:

expert systems facts & rules inference engines certainty user interfaces systems structure

facts & rules facts... (gives daisy milk) (lives-in daisy pasture) (has daisy hair) (eats daisy grass) rules... (Rule 1 (has ?x hair) => (is ?x mammal)) (Rule 2 (is ?x mammal) (has ?x hoofs) => (is ?x ungulate)) (Rule 3 (is ?x ungulate) (chews ?x cud) (goes ?x moo) => (is ?x cow))

forward chaining exhaustive application of rules over facts... forward chain UNTIL no change occurs DO FOR each rule in the ruleset DO IF all antecedents are facts AND not all consequents are facts THEN add consequents to facts (avoid duplicates) & note that a change has occurred

forward chaining example (defvar facts1 '((big elephant) (small mouse) (small sparrow) (big whale) (ontop elephant mouse) )) (defvar rules1 '((Rule 1 (heavy ?x) (small ?y) (ontop ?x ?y) => (squashed ?y) (sad ?x)) (Rule 2 (big ?x)=> (heavy ?x)) (Rule 3 (light ?x)=> (portable ?x)) (Rule 4 (small ?x)=> (light ?x)) )) > (fwd-chain rules1 facts1)) ((portable sparrow) (portable mouse) (squashed mouse) (sad elephant) (heavy whale) (heavy elephant) (light sparrow) (light mouse) (big elephant) (small mouse) (small sparrow) (big whale) (ontop elephant mouse))

backward chaining goal directed... bwd-chain( goal, rules ) IF goal is in facts THEN report success FOR each rule in ruleset DO IF goal is one of rule's consequents THEN call bwd-chain on each antecedent & check result IF all tests are proved THEN add consequents to facts & report success

backward chaining example (setf *rules* '((Rule 1 (has ?x warm-blood) => (is ?x mammal)) (Rule 2 (is ?x mammal) (has ?x hoofs) => (is ?x ungulate)) (Rule 3 (is ?x ungulate) (chews ?x cud) (goes ?x moo) => (is ?x cow)) (Rule 4 (lives-in ?x pasture) (eats ?x grass) => (chews ?x cud) (is ?x herbivore)) (Rule 5 (has ?x hair) => (is ?x mammal)) (Rule 6 (gives ?x milk) => (is ?x mammal)) (Rule 7 (is ?x herbivore) (is ?x ungulate) (gives ?x milk) => (is ?x cow)))) (setf *facts*'((gives daisy milk) (lives-in daisy pasture) (has daisy hair) (eats daisy grass) (has daisy hoofs) ))

backward chaining example... see attached...

approaching ExSys rule structure other Kn forms certainty factors user interfaces mixing inference engines systems structure

rule structure and, or, not run program code

other Kn forms hierarchies, etc frames... watch this space...

certainty factors correct facts + absolute inference rules = guaranteed conclusions uncertain evidence + rough inference rules = expert advice

certainty factors (CVs) range -1 (absolute false) to +1 (absolute true) facts have CVs rules CVs - attenuation factors rule antecedent CVs combined... and / or / not => min / max / negate... result multiplied by attenuation factor......to give consequent CVs

Combining CVs from multiple rules assume 2 rules giving cv1 & cv2... cv1 & cv2 are both +ve cv1 + cv2 - (cv1 * cv2) cv1 & cv2 are both –ve cv1 + cv2 + (cv1 * cv2) one +ve & the other –ve (cv1 + cv2) / (1 - min( abs(cv1), abs(cv2) ))

user interfaces usability engineering feedback what? why? how?

system structure

conflict resolution refraction do not re-use rule until conditions changed recency prefer rules most recently found in WS specificity prefer most specific confidence prefer "better rules"

other design issues mixing inference engines Kn acquisition Kn engineering