Computing MUS-Based Inconsistency Measures

Abstract We detail two instantiations of a generic algorithm for the problematic and MUS-variable-based inconsistency measures, based on answer set programming and Boolean satisfiability (SAT). Empirically, the SAT-based approach allows for more efficiently computing the measures when compared to enumerating all minimal correction subsets of a knowledge base.

Authors

• Isabelle Kuhlmann
• Andreas Niskanen
• Matti Järvisalo

Keywords

No keywords are indexed for this paper.