Consistency-Based Diagnosis

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, California
The Scientific MEthod 8th science 2013.
OWL - DL. DL System A knowledge base (KB) comprises two components, the TBox and the ABox The TBox introduces the terminology, i.e., the vocabulary of.
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
1 Fault Diagnosis for Timed Automata Stavros Tripakis VERIMAG.
Lect.3 Modeling in The Time Domain Basil Hamed
Bayesian Network and Influence Diagram A Guide to Construction And Analysis.
Consistency-based diagnosis 1 Introduction 2 Diagnosis as constrain propagation plus register of dependencies 3 General Diagnostic Engine:GDE 4 A theory.
CPSC 502, Lecture 15Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 15 Nov, 1, 2011 Slide credit: C. Conati, S.
Week 7 - Wednesday.  What did we talk about last time?  Set proofs and disproofs  Russell’s paradox.
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
© C. Kemke1Expert Systems Tasks COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
CPSC 322 Introduction to Artificial Intelligence September 13, 2004.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.5 [P]: Propositions and Inference Sections.
Software Testing and Quality Assurance
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
Relational Data Mining in Finance Haonan Zhang CFWin /04/2003.
Artificial Intelligence
The Component-Attribute Approach Birgit Mayer 5 th April 2005.
Firewall Policy Queries Author: Alex X. Liu, Mohamed G. Gouda Publisher: IEEE Transaction on Parallel and Distributed Systems 2009 Presenter: Chen-Yu Chang.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Models -1 Scientists often describe what they do as constructing models. Understanding scientific reasoning requires understanding something about models.
Measuring Model Complexity (Textbook, Sections ) CS 410/510 Thurs. April 27, 2007 Given two hypotheses (models) that correctly classify the training.
Automated Reasoning Matt Whipple and Brian Vees. Overview What is automated reasoning? What is automated reasoning? Properties of inference procedures.
Data Mining with Decision Trees Lutz Hamel Dept. of Computer Science and Statistics University of Rhode Island.
Functions P.5.
Scientific Thinking - 1 A. It is not what the man of science believes that distinguishes him, but how and why he believes it. B. A hypothesis is scientific.
EXPERT SYSTEMS Part I.
Scientific method - 1 Scientific method is a body of techniques for investigating phenomena and acquiring new knowledge, as well as for correcting and.
Copyright © Cengage Learning. All rights reserved.
Introduction to Model- Based Diagnosis Meir Kalech Partially based on the slides of Peter Struss.
Structural Abstraction for Strong Fault Models Diagnosis (DX 2014 BISFAI 2015) Roni SternMeir KalechOrel Elimelech Ben Gurion University of the Negev,
CS62S: Expert Systems Based on: The Engineering of Knowledge-based Systems: Theory and Practice A. J. Gonzalez and D. D. Dankel.
Nattee Niparnan. Easy & Hard Problem What is “difficulty” of problem? Difficult for computer scientist to derive algorithm for the problem? Difficult.
An Introduction to Artificial Intelligence and Knowledge Engineering N. Kasabov, Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering,
Intro to Architecture – Page 1 of 22CSCI 4717 – Computer Architecture CSCI 4717/5717 Computer Architecture Topic: Introduction Reading: Chapter 1.
1 TMS and ATMS Philippe Dague and Yuhong YAN NRC-IIT
Machine Learning CSE 681 CH2 - Supervised Learning.
Artificial Intelligence Building Knowledge Base Chapter 8.
INTRODUCTION TO THE THEORY OF COMPUTATION INTRODUCTION MICHAEL SIPSER, SECOND EDITION 1.
DECIDABILITY OF PRESBURGER ARITHMETIC USING FINITE AUTOMATA Presented by : Shubha Jain Reference : Paper by Alexandre Boudet and Hubert Comon.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
Categories and Computer Science
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 2: Abilities of Computers.
1 Computer Group Engineering Department University of Science and Culture S. H. Davarpanah
Copyright © Cengage Learning. All rights reserved.
- 1 -  P. Marwedel, Univ. Dortmund, Informatik 12, 05/06 Universität Dortmund Validation - Formal verification -
Sampling and estimation Petter Mostad
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
1 Consistent-based Diagnosis Yuhong YAN NRC-IIT. 2 Main concepts in this paper  (Minimal) Diagnosis  Conflict Set  Proposition 3.3  Corollary 4.5.
Finite State Machines (FSM) OR Finite State Automation (FSA) - are models of the behaviors of a system or a complex object, with a limited number of defined.
RULES Patty Nordstrom Hien Nguyen. "Cognitive Skills are Realized by Production Rules"
Of An Expert System.  Introduction  What is AI?  Intelligent in Human & Machine? What is Expert System? How are Expert System used? Elements of ES.
The Process of Conducting Research. What is a theory? a set of general principles that explains the how and why of phenomena. Theories are not directly.
An Introduction to Scientific Research Methods in Geography Chapter 2: Fundamental Research Concepts.
Lecture 8-2CS250: Intro to AI/Lisp What do you mean, “What do I mean?” Lecture 8-2 November 18 th, 1999 CS250.
Chapter 1 Introduction to Research in Psychology.
Reinforcement Learning for Mapping Instructions to Actions S.R.K. Branavan, Harr Chen, Luke S. Zettlemoyer, Regina Barzilay Computer Science and Artificial.
Week 7 - Wednesday.  What did we talk about last time?  Proving the subset relationship  Proving set equality  Set counterexamples  Laws of set algebra.
5 Lecture in math Predicates Induction Combinatorics.
Fuzzy Relations( 關係 ), Fuzzy Graphs( 圖 形 ), and Fuzzy Arithmetic( 運算 ) Chapter 4.
Topics  Direct Predicate Characterization as an evaluation method.  Implementation and Testing of the Approach.  Conclusions and Future Work.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Formal Language & Automata Theory
REASONING WITH UNCERTANITY
Logic and Computer Design Fundamentals
Chapter 9 TURING MACHINES.
The computation of hitting sets: Review and new algorithms
전문가 시스템(Expert Systems)
Presentation transcript:

Consistency-Based Diagnosis Hal Lindsey CSCE 580

Introduction The Idea of consistency-based diagnosis stemmed from work done by Raymon Reiter and Johan de Kleer Developed to diagnose physical devices Main idea is that when a device doesn’t work, some components will be misbehaving Need a way to figure out which components are misbehaving

What is Diagnosis? Definition Goal of diagnosis Two main approaches Diagnosis in artificial intelligence relates to the development of algorithms and techniques that are able to determine whether the behavior of a system is correct Goal of diagnosis Given a description of some system and observations about the system, be able to determine what parts of the system are malfunctioning given unexpected behavior Two main approaches Expert Model-based

Expert Diagnosis Also referred to as heuristic diagnosis Based on experience from experts of the system; Experts determine diagnostic criteria Examples Rules of thumb Statistical intuitions Past experiences Main Drawbacks from this approach Difficulty acquiring the expertise Complexity of the learning Lack of robustness Consistency/Completeness

Model-based Diagnosis Also known as diagnosis from first principles Construct a causal model of the system, if things go wrong try to figure out what in the model isn’t working Flow Diagram

Model-based Diagnosis (Cont.) Benefits of this approach More precise modeling System formalization Expertise not required Reiter decided this was the best approach for diagnosis He developed a general theoretical foundation based on first principles

Problem Formulation Formulation of system and observation Need a general formulation to cover variety of domains Define a domain-independent concept of a system A system is a pair (SD, COMP) where: (1) SD, the system description, is a set of first-order sentences (2) COMP, the system components, is a finite set of constant

System Formulation Example The system below can be described as: COMP = {A1, A2, X1, X2, O1} ANDG(X) & ~AB(X) D out(x) = and(in1(x), in2(x)) , XORG(X) & ~AB(X) D out(x) = xor(in1(x), in2(x)) , ORG(X) & ~AB(X) D out(x) = or(in1(x), in2(x)) , ANDG(A1), ANDG(A2) , XORG(X1 ), XORG(X2 ), ORG(O1) out(X1 ) = in2(A2), out(X1) = in1(X2), out(A2) = in1(O1), in1(A2) = in2(X2) , in1(X1) = in1(A1), in2(X1) = in2(A1), out(A1) = in2(O1) Plus axioms that circuit inputs are binary and of boolean algebra

Observations of Systems Real world diagnostic settings involve observations Without observations, we have no way of determining whether something is wrong and hence whether a diagnosis is called for An observation of a system is a finite set of first-order sentences denoted OBS A diagnosis will comprise: (SD,COMP,OBS)

Observation Formulation Example The following observations of the system could be observed: in1(X1) = 1, in2(X1) = 0, in1(A2) = 1, out(X2) = 1, out(O1) = 0 Thus, circuit is faulty Formally, the system if faulty if SD union {~Ab(c)| c in COMP} union OBS is inconsistent

Formal Diagnosis Diagnosis is the conjecture that certain components are faulty and the rest are normal Principle of Parsimony Diagnosis is a conjecture that some minimal set of components are faulty Formal diagnosis for (SD,COMP,OBS) is a minimal set D subset of COMP such that SD union OBS union {Ab(c) | c in D} union {~Ab(c)| c in COMP – D} is consistent Turns out D is determined by COMP – D, so Diagnosis is minimal D subset of COMP such that SD union {~Ab(c)| c in COMP – D} is consistent

Computing Diagnoses Generate Diagnosis from our Previous Example: in1(X1) = 1, in2(X1) = 0, in1(A2) = 1, out(X2) = 1, out(O1) = 0 In this example, there are 3 possible diagnoses: {X1}, {X2, O1}, {X2, A2}

Computing Diagnoses (Cont.) How D is computed: Generate all subsets of COMP Check for inconsistency Very inefficient More efficient: Formalize the notion of conflict set whereby you choose D such that COMP – D is not a conflict set for (SD, COMP, OBS) Formalize notion of hitting set Get minimal hitting set Tree-labeling algorithm given by Reiter

References Reiter, Raymond. A Theory of Diagnosis from First Principles. Artifical Intelligence, Vol 32, No. 1. (April 1987), pp 57-95. Peischl & Wotawa. Model-Based Diagnosis or Reasoning from First Principles. Intelligent Systems, Vol 18, No. 3. (May/June 2003), pp 32-37. Morgenstern, Leora. Knowledge Representation. http://www-formal.stanford.edu/leora/kcourse/