How should I compute my candidates? A taxonomy and classification of diagnosis computation algorithms
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 5 of its 60 references that are in the map. First posted on arXiv 26 Jul 2022.
Builds on
5 of 60 references.
References · 5
- 2021An Efficient Diagnosis Algorithm for Inconsistent Constraint Setscited by 11
- 2016The minimal hitting set generation problem: algorithms and computationcited by 5
- 2016Interactive Debugging of Knowledge Basescited by 4
- 2020DynamicHS: Streamlining Reiter's Hitting-Set Tree for Sequential Diagnosiscited by 3
- 2014Sequential Diagnosis by Abstractioncited by 2
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 0; 2026: 1.
3 papers.