Abstract
For a wide selection of problems, characterizing them as a group of sets allows us to derive desired solutions by computing their minimal hitting sets. For his approach at model-based diagnosis, for instance, Raymond Reiter suggested to compute diagnoses as minimal hitting sets of encountered conflicts between behavioral assumptions, and defined a corresponding MHS algorithm. In this paper, we show a new twist to his idea that improves on the resources spent. The focused search strategy of our RC-Tree algorithm is finally able to avoid all the redundant computations that occur in the original version.
Originalsprache | Deutsch (Österreich) |
---|---|
Titel | 2015 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW) |
Seiten | 78-84 |
Seitenumfang | 7 |
DOIs | |
Publikationsstatus | Veröffentlicht - 5 Nov. 2015 |
Extern publiziert | Ja |
Veranstaltung | 2015 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW) - Gaithersburg, MD, USA Dauer: 2 Nov. 2015 → 5 Nov. 2015 |
Konferenz
Konferenz | 2015 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW) |
---|---|
Zeitraum | 2/11/15 → 5/11/15 |
Schlagwörter
- Heuristic algorithms
- Space exploration
- Redundancy
- Software
- Computational modeling
- Software algorithms
- Search problems