Thomas Quaritsch

Learn More
The Boolean approach to computing minimal hitting sets proposed by Lin and Jiang is known to offer very attractive general performance, but also has its issues, specifically with a cardinality-restricted search. In this paper we propose optimizations regarding the refinement rules, also offering a revised decision strategy as well as optimized termination(More)
Diagnosis, i.e., the identification of root causes for failing or unexpected system behavior, is an important task in practice. Within the last three decades, many different AI-based solutions for solving the diagnosis problem have been presented and have been gaining in attraction. This leaves us with the question of which algorithm to prefer in a certain(More)
Complementing recent research regarding the direct computation of diagnoses in theorem provers, complete hitting set algorithms are still an essential technique in the context of model-based diagnosis. Besides deriving diagnoses from available conflicts, they may even drive the search for those unsatisfiable cores in the problem description. Thus a series(More)
  • 1