DeepAI AI Chat
Log In Sign Up

Model-Based Diagnosis using Structured System Descriptions

by   A. Darwiche, et al.

This paper presents a comprehensive approach for model-based diagnosis which includes proposals for characterizing and computing preferred diagnoses, assuming that the system description is augmented with a system structure (a directed graph explicating the interconnections between system components). Specifically, we first introduce the notion of a consequence, which is a syntactically unconstrained propositional sentence that characterizes all consistency-based diagnoses and show that standard characterizations of diagnoses, such as minimal conflicts, correspond to syntactic variations on a consequence. Second, we propose a new syntactic variation on the consequence known as negation normal form (NNF) and discuss its merits compared to standard variations. Third, we introduce a basic algorithm for computing consequences in NNF given a structured system description. We show that if the system structure does not contain cycles, then there is always a linear-size consequence in NNF which can be computed in linear time. For arbitrary system structures, we show a precise connection between the complexity of computing consequences and the topology of the underlying system structure. Finally, we present an algorithm that enumerates the preferred diagnoses characterized by a consequence. The algorithm is shown to take linear time in the size of the consequence if the preference criterion satisfies some general conditions.


page 1

page 2

page 3

page 4


Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph

We present an improved algorithm for computing the 4-edge-connected comp...

Determining 4-edge-connected components in linear time

In this work, we present the first linear time deterministic algorithm c...

Find Subtrees of Specified Weight and Cycles of Specified Length in Linear Time

We introduce a variant of DFS which finds subtrees of specified weight i...

Repairing Description Logic Ontologies by Weakening Axioms

The classical approach for repairing a Description Logic ontology O in t...

Model enumeration in propositional circumscription via unsatisfiable core analysis

Many practical problems are characterized by a preference relation over ...

Extending Consequence-Based Reasoning to SRIQ

Consequence-based calculi are a family of reasoning algorithms for descr...

Consequence-Based Axiom Pinpointing

Axiom pinpointing refers to the problem of finding the axioms in an onto...