A Comparison of ASP-Based and SAT-Based Algorithms for the Contension Inconsistency Measure

Isabelle Kuhlmann, Anna Gessler, Vivien Laszlo, Matthias Thimm

Abstract: We propose an algorithm based on satisfiability problem (SAT) solving for determining the contension inconsistency degree in propositional knowledge bases. In addition, we present a revised version of an algorithm based on answer set programming (ASP), which serves the same purpose. In an experimental analysis, we compare the two algorithms to each other, as well as to a naive baseline method. Our results demonstrate that both the SAT and the ASP approach expectedly outperform the baseline algorithm. Further, the revised ASP method is not only superior to the SAT approach, but also to its predecessors from the literature. Hence, it poses a new state of the art.