General rightsThis document is made available in accordance with publisher policies. Please cite only the published version using the reference above. There is extensive theoretical work on measures of inconsistency for arbitrary formulae in knowledge bases. Many of these are dened in terms of the set of minimal inconsistent subsets (MISes) of the base. However, few have been implemented or experimentally evaluated to support their viability, since computing all MISes is intractable in the worst case. Fortunately, recent work on a related problem of minimal unsatisable sets of clauses (MUSes) oers a viable solution in many cases. In this paper, we begin by drawing connections between MISes and MUSes through algorithms based on a MUS generalization approach and a new optimized MUS transformation approach to nding MISes. We implement these algorithms, along with a selection of existing measures for at and stratied knowledge bases, in a tool called mimus. We then carry out an extensive experimental evaluation of mimus using randomly generated arbitrary knowledge bases. We conclude that these measures are viable for many large and complex random instances. Moreover, they represent a practical and intuitive tool for inconsistency handling.