Deriving All Minimal Hitting Sets Based on Join Relation

Deriving all minimal hitting sets (MHSes) for a family of conflict sets is a classical problem in model-based diagnosis. A technique for distributed MHSes based on the join relation of elements is proposed. Then, a strategy for deriving all distributed MHSes is presented. If the family of sets is decomposed into a number of equivalence classes based on the join relation, then parallel computation of MHSes for each distribution can be applied. Moreover, an incremental, distributed approach is introduced. When a new conflict set is added, only related distributed MHSes are chosen to incrementally update the final result. From a theoretical point of view, the complexity of the distributed algorithm is O(2num/k), while the complexity of the corresponding centralized algorithm is O(2num), with k and num being the number of equivalence classes and the number of basic elements in all the conflict sets, respectively. Furthermore, compared with the corresponding centralized approach, a large number of set-containment checks are avoided by the incremental, distributed approach. Experimental results, including both numerous artificial examples and typical International Symposium on Circuits and Systems-85 benchmark circuit conflict set examples, offer evidence that, compared with centralized methods, the efficiency for deriving all MHSes in a distributed (incremental) way is considerably improved.

[1]  Ingo Pill,et al.  Optimizations for the Boolean Approach to Computing Minimal Hitting Sets , 2012, ECAI.

[2]  Georg Gottlob,et al.  Computational aspects of monotone dualization: A brief survey , 2008, Discret. Appl. Math..

[3]  Dietmar Jannach,et al.  Parallelized Hitting Set Computation for Model-Based Diagnosis , 2015, AAAI.

[4]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[5]  Rui Abreu,et al.  MHS2: A Map-Reduce Heuristic-Driven Minimal Hitting Set Search Algorithm , 2013, MUSEPAT.

[6]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[7]  Endre Boros,et al.  A Fast and Simple Parallel Algorithm for the Monotone Duality Problem , 2009, ICALP.

[8]  Amir Fijany,et al.  New approaches for efficient solution of hitting set problem , 2004 .

[9]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[10]  Brian C. Williams,et al.  Diagnosing Multiple Faults , 1987, Artif. Intell..

[11]  Peter L. Hammer,et al.  Boolean Functions - Theory, Algorithms, and Applications , 2011, Encyclopedia of mathematics and its applications.

[12]  Franz Wotawa,et al.  A variant of Reiter's hitting-set algorithm , 2001, Inf. Process. Lett..

[13]  Aimin Hou,et al.  A Theory of Measurement in Diagnosis from First Principles , 1994, Artif. Intell..

[14]  Russell Greiner,et al.  A Correction to the Algorithm in Reiter's Theory of Diagnosis , 1989, Artif. Intell..

[15]  Gerhard Friedrich,et al.  Focusing on independent diagnosis problems , 1994, Annals of Mathematics and Artificial Intelligence.

[16]  Johan de Kleer,et al.  Hitting set algorithms for model-based diagnosis , 2011 .

[17]  Dantong Ouyang,et al.  Improved Algorithms for Deriving All Minimal Conflict Sets in Model-Based Diagnosis , 2007, ICIC.

[18]  Ouyang Dan-tong,et al.  Computing Minimal Hitting Sets with Genetic Algorithm , 2006 .

[19]  Mattias Nyberg.  A Generalized Minimal Hitting-Set Algorithm to Handle Diagnosis With Behavioral Modes , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[20]  Meir Kalech,et al.  Exploring the Duality in Conflict-Directed Model-Based Diagnosis , 2012, AAAI.

[21]  Karem A. Sakallah,et al.  Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints , 2007, Journal of Automated Reasoning.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Gregory M. Provan,et al.  Computing Minimal Diagnoses by Greedy Stochastic Search , 2008, AAAI.

[24]  Staal A. Vinterbo,et al.  Minimal approximate hitting sets and rule templates , 2000, Int. J. Approx. Reason..

[25]  Brian C. Williams,et al.  Conflict-directed A* and its role in model-based embedded systems , 2007, Discret. Appl. Math..

[26]  James Bailey,et al.  Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization , 2005, PADL.

[27]  Ouyang Dantong,et al.  A method of combining SE-tree to compute all minimal hitting sets , 2006 .

[28]  Li Lin,et al.  The computation of hitting sets: Review and new algorithms , 2003, Inf. Process. Lett..

[29]  Rui Abreu,et al.  A Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis , 2009, SARA.

[30]  Vladimir Gurvich,et al.  A global parallel algorithm for the hypergraph transversal problem , 2007, Inf. Process. Lett..