An Algorithm for the Contension Inconsistency Measure Using Reductions to Answer Set Programming

Isabelle Kuhlmann, Matthias Thimm

Abstract: We present an algorithm for determining inconsistency degrees wrt. the contension inconsistency measure [7] which utilizes three-valued logic to determine the minimal number of atoms that are assigned truth value B (paradoxical/both true and false). Our algorithm is based on an answer set programming encoding for checking for upper bounds and a binary search algorithm on top of that. We experimentally show that the new algorithm significantly outperforms the state of the art .