How should I compute my candidates? A taxonomy and classification of diagnosis computation algorithms
arXiv:2207.12583 · doi:10.3233/FAIA230490
Abstract
This work proposes a taxonomy for diagnosis computation methods which allows their standardized assessment, classification and comparison. The aim is to (i) give researchers and practitioners an impression of the diverse landscape of available diagnostic techniques, (ii) allow them to easily retrieve the main features as well as pros and cons of the approaches, (iii) enable an easy and clear comparison of the techniques based on their characteristics wrt. a list of important and well-defined properties, and (iv) facilitate the selection of the "right" algorithm to adopt for a particular problem case, e.g., in practical diagnostic settings, for comparison in experimental evaluations, or for reuse, modification, extension, or improvement in the course of research.
arXiv commentUpdated version including a reference to the published peer-reviewed version of this work, which appeared in the proceedings of the European Conference on Artificial Intelligence (ECAI) 2023
References in corpus (6)
- Interactive Debugging of Knowledge Bases
- Interactive ontology debugging: two query strategies for efficient fault localization
- Sequential Diagnosis by Abstraction
- RBF-HS: Recursive Best-First Hitting Set Search
- How should I compute my candidates? A taxonomy and classification of diagnosis computation algorithms
- DynamicHS: Streamlining Reiter's Hitting-Set Tree for Sequential Diagnosis