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)

Slides:



Advertisements
Similar presentations
Inference Rules Universal Instantiation Existential Generalization
Advertisements

10/4/2003COMP 474/674 Fall 2003 Michelle Khalife1 Conflict Resolution in CLIPS COMP 474/674 FALL 2003 Michelle Khalifé.
1 Rule Based Systems Introduction to Production System Architecture.
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, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
Inferences The Reasoning Power of Expert Systems.
(FO) Inference Methods CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Expert System Shells - Examples
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.4) January, 14, 2009.
Lets remember about Goal formulation, Problem formulation and Types of Problem. OBJECTIVE OF TODAY’S LECTURE Today we will discus how to find a solution.
Samad Paydar Ferdowsi University of Mashhad.  C Language Integrated Production System (CLIPS)  A tool for building expert systems  An expert system.
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,
1 01/12/2011Knowledge-Based Systems, Paula Matuszek Intro to CLIPS Paula Matuszek CSC 9010, Spring, 2011.
Chapter 7: Introduction to CLIPS
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
Expert System Human expert level performance Limited application area Large component of task specific knowledge Knowledge based system Task specific knowledge.
CPSC 322 Introduction to Artificial Intelligence October 27, 2004.
1 Using Search in Problem Solving Part II. 2 Basic Concepts Basic concepts: Initial state Goal/Target state Intermediate states Path from the initial.
Introduction to CLIPS (Chapter 7) Fact List (contains data) Knowledge Base (contains rules) Inference Engine (controls execution)
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.
Constraint Satisfaction Problems
Expert Systems 3 1 Rewriting Rules, CLIPS Content of this lecture: 1.Interpretation of rules 2.Example: CLIPS Sorting 3.Non-determinism 4.Control regimes:
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.
© C. Kemke1Reasoning - Introduction COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
© C. Kemke Control 1 COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
Production Rules Rule-Based Systems. 2 Production Rules Specify what you should do or what you could conclude in different situations. Specify what you.
EXPERT SYSTEMS Part I.
Bahar Qarabaqi Azar 19 th, FC Inferencing Initial information about the problem being asserted into working memory. Database Sensors User.
Modelling planning problems using PDDL
CS 561, Session 25 1 Introduction to CLIPS Overview of CLIPS Facts Rules Rule firing Control techniques Example.
Artificial Intelligence CSC 361
Expert Systems Infsy 540 Dr. Ocker. Expert Systems n computer systems which try to mimic human expertise n produce a decision that does not require judgment.
INFERENCE IN FIRST-ORDER LOGIC IES 503 ARTIFICIAL INTELLIGENCE İPEK SÜĞÜT.
1 01/12/2011Knowledge-Based Systems, Paula Matuszek More Intro to CLIPS Paula Matuszek CSC 9010, Spring, 2011.
1 Lab Session-III CSIT-120 Fall 2000 Revising Previous session Data input and output While loop Exercise Limits and Bounds Session III-B (starts on slide.
1 Programming a Knowledge Based Application. 2 Overview.
Chapter 7: Introduction to CLIPS Expert Systems: Principles and Programming, Fourth Edition.
Production Systems A production system is –a set of rules (if-then or condition-action statements) –working memory the current state of the problem solving,
Introduction to search Chapter 3. Why study search? §Search is a basis for all AI l search proposed as the basis of intelligence l inference l all learning.
Abdul Rahim Ahmad MITM 613 Intelligent System Chapter 2: Rule-based Systems.
1 Agenda Modeling problems in Propositional Logic SAT basics Decision heuristics Non-chronological Backtracking Learning with Conflict Clauses SAT and.
Copyright © Curt Hill Turtles The beginning of media computation.
CS 415 – A.I. Slide Set 5. Chapter 3 Structures and Strategies for State Space Search – Predicate Calculus: provides a means of describing objects and.
Jess: A Rule-Based Programming Environment Reporter: Yu Lun Kuo Date: April 10, 2006 Expert System.
Expert System Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
1 Defining a Problem as a State Space 1. Define a state space that contains all the possible configurations of the relevant objects. 2. Specify one (or.
COM362 Knowledge Engineering Inferencing 1 Inferencing: Forward and Backward Chaining John MacIntyre
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Search CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Artificial Intelligence Lecture No. 26 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Basic Problem Solving Search strategy  Problem can be solved by searching for a solution. An attempt is to transform initial state of a problem into some.
1 Knowledge Based Systems (CM0377) Lecture 10 (Last modified 19th March 2001)
Chapter 4: Inference Techniques
Artificial Intelligence Lecture No. 19 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Inference in First Order Logic. Outline Reducing first order inference to propositional inference Unification Generalized Modus Ponens Forward and backward.
Backward chaining Assume the same representation of rules as in forward chaining, i.e. If is true, is true, … is true Then is true. Rule interpretation.
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
Solving problems by searching A I C h a p t e r 3.
Forward and Backward Chaining
Expert System Seyed Hashem Davarpanah University of Science and Culture.
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.5) Sept, 13, 2013.
Intelligent Systems Rule based systems 1. Aims of session To understand Basic principles Forward chaining Problems with rule-based systems Backward chaining.
Jörg Kewisch, June 10, 2013, LILUG Meeting CLIPS C Language Integrated Production System Developed at the Software Development Branch, NASA Lyndon B. Johnson.
Advanced AI Session 2 Rule Based Expert System
Preserving and Applying Human Expertise: Knowledge-Based Systems
Architecture Components
Chapter 7: Introduction to CLIPS
Presentation transcript:

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) resolution)putdeductions into WM put facts into WM match WM with RHS of rules select one rule (conflict resolution) resolution) put premises as sub-goals into WM put goal into WM ForwardChaining BackwardChaining

Conflict Resolution (Recap)  conflict set the set of rules which match the WM content in each cycle  not just rules, but rules with variable instantiations deterministic rule set  at most 1 rule matched at each cycle (i.e. 0 or 1) non-deterministic rule set  more than 1 matching rule  inference engine (interpreter) must select one rule to apply using its conflict resolution strategy

Choice of Conflict Resolution Strategy  determine how the ES search in the problem space how quick to find the solution if the system will find a solution  and if found, which solution  should be chosen to fit your application  desirable properties stability  follow a line of reasoning sensitivity  react quickly to any change in WM

Common Conflict Resolution Strategies  textual order  refractoriness  recency  breadth  MEA  specificity  LEX  simplicity  priority (salience)  strategies can be combined!

Textual order  assume that rules are ordered (linearly)  fire the first matching rule  most important rules should be placed early in the KB

Recency  rules that use recently added data are favoured (depth-first)  if >1 rule use the same (most) recent data, the next most recent data used in each of the rules is used to determine which one is preferred  pursues the current line of reasoning rather than being side-tracked by other deductions

Breadth Strategy  rules which have been activated for a long time are preferred to newly activated ones  i.e. rules that match old facts are preferred than rules that match new facts  tends to search in a breadth-first manner

MEA  "Means-Ends Analysis" an early AI technique for backward reasoning  rules whose 1 st condition uses recently added data are favoured

Specificity (complexity)  more specific rules are preferred to more general rules rules with greater number of conditions rules with fewer variables are more specific more instantiated by the WM are more specific  more specific rules should be applied earlier because they use more data and so can be used for special cases or exceptions to general rules

LEX  apply recency  if there is still conflict, apply specificity

Priority (salience)  in some systems, rules can have a priority (salience) attached, indicating how likely the rule is to be a good solution  fire rule with highest priority  priority should be used to: emphasise the importance of a rule delay firing of a non-promising rule NOT to establish the order in which all the rules should fire

Conflict Resolution in CLIPS  CLIPS fires rules from the agenda in order of their salience.  Salience is normally defined implicity by the conflict resolution strategy.  CLIPS offers a variety of CR strategies. recency (depth), breadth, LEX, MEA, complexity, simplicity & random strategies. default is recency.  You can also explicitly set the salience of a rule  In the CLIPS IDE you can set the CR strategy: Commands -> Option -> Salience Evaluation  You can also set it at the prompt. It will return the previous strategy. CLIPS> (set-strategy breadth) depth CLIPS>

13 Lab exercise 1:  Download “newsnow.clp” from the class webpage. This is a slightly modified version of the snow program.  Start the CLIPS IDE and load the newsnow.clp file.  Watch the facts and agenda windows and step through an execution (using Run 1).  Change the salience strategy and do it again. Try several strategies.  Which seems like the best choice? Worst? Why?

14 Lab Exercise 2:  Modify the newsnow program using salience to force all the user input questions to be first.  What form of conflict resolution is this most similar to?  Now modify it to reach a conclusion as soon as possible.  What form of CR do you have now?