A More General Theory of Diagnosis from First Principles

• URL: http://arxiv.org/abs/2309.16180v1
• Date: Thu, 28 Sep 2023 05:47:52 GMT
• Title: A More General Theory of Diagnosis from First Principles
• Authors: Alban Grastien and Patrik Haslum and Sylvie Thi\'ebaux
• Abstract summary: We generalise Reiter's theory to be agnostic to the types of systems and diagnoses considered. computing the minimal diagnosis is achieved by exploring the space of diagnosis hypotheses. We present two implementations of these algorithms, using test solvers based on satisfiability and search.
• Score: 2.693342141713236
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Model-based diagnosis has been an active research topic in different communities including artificial intelligence, formal methods, and control. This has led to a set of disparate approaches addressing different classes of systems and seeking different forms of diagnoses. In this paper, we resolve such disparities by generalising Reiter's theory to be agnostic to the types of systems and diagnoses considered. This more general theory of diagnosis from first principles defines the minimal diagnosis as the set of preferred diagnosis candidates in a search space of hypotheses. Computing the minimal diagnosis is achieved by exploring the space of diagnosis hypotheses, testing sets of hypotheses for consistency with the system's model and the observation, and generating conflicts that rule out successors and other portions of the search space. Under relatively mild assumptions, our algorithms correctly compute the set of preferred diagnosis candidates. The main difficulty here is that the search space is no longer a powerset as in Reiter's theory, and that, as consequence, many of the implicit properties (such as finiteness of the search space) no longer hold. The notion of conflict also needs to be generalised and we present such a more general notion. We present two implementations of these algorithms, using test solvers based on satisfiability and heuristic search, respectively, which we evaluate on instances from two real world discrete event problems. Despite the greater generality of our theory, these implementations surpass the special purpose algorithms designed for discrete event systems, and enable solving instances that were out of reach of existing diagnosis approaches.

Related papers

• Diagnosis driven Anomaly Detection for CPS [44.97616703648182]
  We propose a method for utilizing deep learning-based anomaly detection to generate inputs for Consistency-Based Diagnosis (CBD) We evaluate our approach on a simulated and a real-world CPS dataset, where our model demonstrates strong performance relative to other state-of-the-art models.
  arXiv  Detail & Related papers  (2023-11-27T15:34:40Z)
• OpenClinicalAI: An Open and Dynamic Model for Alzheimer's Disease Diagnosis [11.775648630734949]
  Alzheimer's disease (AD) cannot be reversed or cured, but timely diagnosis can significantly reduce the burden of treatment and care. Current research on AD diagnosis models usually regards the diagnosis task as a typical classification task. We propose OpenClinicalAI for direct AD diagnosis in complex and uncertain clinical settings.
  arXiv  Detail & Related papers  (2023-07-03T12:35:03Z)
• OpenAPMax: Abnormal Patterns-based Model for Real-World Alzheimer's Disease Diagnosis [9.316162293112738]
  We propose an open-set recognition model, OpenAPMax, based on the anomaly pattern to address Alzheimer's disease diagnosis. We evaluate the performance of the proposed method with recent open-set recognition, where we obtain state-of-the-art results.
  arXiv  Detail & Related papers  (2023-07-03T11:21:09Z)
• FastDiagP: An Algorithm for Parallelized Direct Diagnosis [64.65251961564606]
  FastDiag is a typical direct diagnosis algorithm that supports diagnosis calculation without predetermining conflicts. We propose a novel algorithm, so-called FastDiagP, which is based on the idea of speculative programming. This mechanism helps to provide consistency checks with fast answers and boosts the algorithm's runtime performance.
  arXiv  Detail & Related papers  (2023-05-11T16:26:23Z)
• Finding Alignments Between Interpretable Causal Variables and Distributed Neural Representations [62.65877150123775]
  Causal abstraction is a promising theoretical framework for explainable artificial intelligence. Existing causal abstraction methods require a brute-force search over alignments between the high-level model and the low-level one. We present distributed alignment search (DAS), which overcomes these limitations.
  arXiv  Detail & Related papers  (2023-03-05T00:57:49Z)
• Causality-Based Multivariate Time Series Anomaly Detection [63.799474860969156]
  We formulate the anomaly detection problem from a causal perspective and view anomalies as instances that do not follow the regular causal mechanism to generate the multivariate data. We then propose a causality-based anomaly detection approach, which first learns the causal structure from data and then infers whether an instance is an anomaly relative to the local causal mechanism. We evaluate our approach with both simulated and public datasets as well as a case study on real-world AIOps applications.
  arXiv  Detail & Related papers  (2022-06-30T06:00:13Z)
• Anytime Diagnosis for Reconfiguration [52.77024349608834]
  We introduce and analyze FlexDiag which is an anytime direct diagnosis approach. We evaluate the algorithm with regard to performance and diagnosis quality using a configuration benchmark from the domain of feature models and an industrial configuration knowledge base from the automotive domain.
  arXiv  Detail & Related papers  (2021-02-19T11:45:52Z)
• Inheritance-guided Hierarchical Assignment for Clinical Automatic Diagnosis [50.15205065710629]
  Clinical diagnosis, which aims to assign diagnosis codes for a patient based on the clinical note, plays an essential role in clinical decision-making. We propose a novel framework to combine the inheritance-guided hierarchical assignment and co-occurrence graph propagation for clinical automatic diagnosis.
  arXiv  Detail & Related papers  (2021-01-27T13:16:51Z)
• Algorithmic Frameworks for the Detection of High Density Anomalies [0.0]
  High-density anomalies are deviant cases positioned in the most normal regions of the data space. This study introduces several non-parametric algorithmic frameworks for unsupervised detection.
  arXiv  Detail & Related papers  (2020-10-09T17:48:02Z)
• Sound, Complete, Linear-Space, Best-First Diagnosis Search [0.0]
  We propose RBF-HS, a diagnostic search method based on Korf's well-known RBFS algorithm. RBF-HS can enumerate an arbitrary fixed number of fault explanations in best-first order within linear space bounds.
  arXiv  Detail & Related papers  (2020-09-25T12:49:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.