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.
Original language | German (Austria) |
---|---|
Title of host publication | 2015 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW) |
Pages | 78-84 |
Number of pages | 7 |
DOIs | |
Publication status | Published - 5 Nov 2015 |
Externally published | Yes |
Event | 2015 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW) - Gaithersburg, MD, USA Duration: 2 Nov 2015 → 5 Nov 2015 |
Conference
Conference | 2015 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW) |
---|---|
Period | 2/11/15 → 5/11/15 |