Parallelized Hitting Set Computation for Model-Based Diagnosis

Model-Based Diagnosis techniques have been successfully applied to support a variety of faultlocalization tasks both for hardware and software artifacts. In many applications, Reiter’s hitting set algorithm has been used to determine the set of all diagnoses for a given problem. In order to construct the diagnoses with increasing cardinality, Reiter proposed a breadth-first search scheme in combination with different tree-pruning rules. Since many of today’s computing devices have multi-core CPU architectures, we propose techniques to parallelize the construction of the tree to better utilize the computing resources without losing any diagnoses. Experimental evaluations show that the approach significantly reduces the required running times.

• Type: Journal
• Year: 2015
• Where: AAAI
• Authors: Dietmar Jannach, Thomas Schmitz, Kostyantyn M. Shchekotykhin
• Keywords: AAAI 2015, Intelligent Agents