Bibliographic Details
| Title: |
On the complexity of inconsistency measurement. |
| Authors: |
Thimm, Matthias1 (AUTHOR) thimm@uni-koblenz.de, Wallner, Johannes P.2 (AUTHOR) |
| Source: |
Artificial Intelligence. Oct2019, Vol. 275, p411-456. 46p. |
| Subjects: |
Computational complexity, Statistical decision making, Measurement |
| Abstract: |
We survey a selection of inconsistency measures from the literature and investigate their computational complexity wrt. decision problems related to bounds on the inconsistency value and the functional problem of determining the actual value. Our findings show that those inconsistency measures can be partitioned into four classes related to their complexity. The first three classes contain measures whose complexities are located on the first three levels of the polynomial hierarchy, respectively. The final class is under standard complexity-theoretic assumptions located beyond the polynomial hierarchy. We provide membership results for all the investigated problems and completeness results for most of them. In addition, we undertake a preliminary study on the computational complexity of the measures on fragments of propositional logic. [ABSTRACT FROM AUTHOR] |
|
Copyright of Artificial Intelligence is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
