Abstract
In this paper, we propose a general framework, both parameterized and parameter-free, for defining a family of fine-grained inconsistency measures for propositional knowledge bases. The parameterized approach allows to encompass several existing inconsistency measures as specific cases, by properly setting its parameter. And the parameter-free approach is defined to avoid the difficulty in choosing a suitable parameter in practice but still keeps a desired ranking for knowledge bases by their inconsistency degrees. The fine granularity of our framework is based on the notion of MIS partition that considers the inner structure of all the minimal inconsistent subsets of a knowledge base. Moreover, MinCostSATbased encodings are provided, which enable the use of efficient SAT solvers for the computation of the proposed measures. We implement these algorithms and test them on some real-world datasets. The preliminary experimental results for a variety of inputs show that the proposed framework gives a wide range of possibilities for evaluating large knowledge bases.
| Original language | English |
|---|---|
| Pages (from-to) | 84-93 |
| Number of pages | 10 |
| Journal | Proceedings of the International Conference on Knowledge Representation and Reasoning |
| Publication status | Published - 1 Jan 2016 |
| Externally published | Yes |
| Event | 15th International Conference on Principles of Knowledge Representation and Reasoning, KR 2016 - Cape Town, South Africa Duration: 25 Apr 2016 → 29 Apr 2016 |