On the practical performance of minimal hitting set algorithms from a diagnostic perspective

Ingo Hans Pill, Thomas Quaritsch, Franz Wotawa

Research output: Contribution to journalArticle

Abstract

Minimal hitting sets (MHSs) meliorate our reasoning in many applications, including AI planning, CNF/DNF conversion, and program debugging. When following Reiter’s ”theory of diagnosis from first principles”, minimal hitting sets are also essential to the diagnosis problem, since diagnoses can be characterized as the minimal hitting sets of conflicts in the behavior of a faulty system. While the large amount of application options led to the advent of a variety of corresponding MHS algorithms, for diagnostic purposes we still lack a comparative evaluation assessing performance characteristics. In this paper, we thus empirically evaluate a set of complete algorithms relevant for diagnostic purposes in synthetic and real-world scenarios. We consider in our experimental evaluation also how cardinality constraints on the solution space, as often established in practice for diagnostic purposes, influence performance in terms of run-time and memory usage.

LanguageEnglish
JournalInternational Journal of Prognostics and Health Management
Volume7
Issue number2
StatusPublished - 2016

Fingerprint

Program debugging
Data storage equipment
Planning

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Fields of Expertise

  • Information, Communication & Computing

Cite this

@article{46651106fd354cf89fd38d5925c0dd13,
title = "On the practical performance of minimal hitting set algorithms from a diagnostic perspective",
abstract = "Minimal hitting sets (MHSs) meliorate our reasoning in many applications, including AI planning, CNF/DNF conversion, and program debugging. When following Reiter’s ”theory of diagnosis from first principles”, minimal hitting sets are also essential to the diagnosis problem, since diagnoses can be characterized as the minimal hitting sets of conflicts in the behavior of a faulty system. While the large amount of application options led to the advent of a variety of corresponding MHS algorithms, for diagnostic purposes we still lack a comparative evaluation assessing performance characteristics. In this paper, we thus empirically evaluate a set of complete algorithms relevant for diagnostic purposes in synthetic and real-world scenarios. We consider in our experimental evaluation also how cardinality constraints on the solution space, as often established in practice for diagnostic purposes, influence performance in terms of run-time and memory usage.",
author = "Pill, {Ingo Hans} and Thomas Quaritsch and Franz Wotawa",
year = "2016",
language = "English",
volume = "7",
journal = "International Journal of Prognostics and Health Management",
issn = "2153-2648",
publisher = "Prognostics and Health Management Society",
number = "2",

}

TY - JOUR

T1 - On the practical performance of minimal hitting set algorithms from a diagnostic perspective

AU - Pill,Ingo Hans

AU - Quaritsch,Thomas

AU - Wotawa,Franz

PY - 2016

Y1 - 2016

N2 - Minimal hitting sets (MHSs) meliorate our reasoning in many applications, including AI planning, CNF/DNF conversion, and program debugging. When following Reiter’s ”theory of diagnosis from first principles”, minimal hitting sets are also essential to the diagnosis problem, since diagnoses can be characterized as the minimal hitting sets of conflicts in the behavior of a faulty system. While the large amount of application options led to the advent of a variety of corresponding MHS algorithms, for diagnostic purposes we still lack a comparative evaluation assessing performance characteristics. In this paper, we thus empirically evaluate a set of complete algorithms relevant for diagnostic purposes in synthetic and real-world scenarios. We consider in our experimental evaluation also how cardinality constraints on the solution space, as often established in practice for diagnostic purposes, influence performance in terms of run-time and memory usage.

AB - Minimal hitting sets (MHSs) meliorate our reasoning in many applications, including AI planning, CNF/DNF conversion, and program debugging. When following Reiter’s ”theory of diagnosis from first principles”, minimal hitting sets are also essential to the diagnosis problem, since diagnoses can be characterized as the minimal hitting sets of conflicts in the behavior of a faulty system. While the large amount of application options led to the advent of a variety of corresponding MHS algorithms, for diagnostic purposes we still lack a comparative evaluation assessing performance characteristics. In this paper, we thus empirically evaluate a set of complete algorithms relevant for diagnostic purposes in synthetic and real-world scenarios. We consider in our experimental evaluation also how cardinality constraints on the solution space, as often established in practice for diagnostic purposes, influence performance in terms of run-time and memory usage.

UR - http://www.scopus.com/inward/record.url?scp=84981289201&partnerID=8YFLogxK

M3 - Article

VL - 7

JO - International Journal of Prognostics and Health Management

T2 - International Journal of Prognostics and Health Management

JF - International Journal of Prognostics and Health Management

SN - 2153-2648

IS - 2

ER -