Abstract | ||
---|---|---|
Minimal inconsistent subsets of knowledge bases in monotonic logics play an important role when investigating the reasons for conflicts and trying to handle them. In the context of non-monotonic reasoning this notion is not as meaningful due to the possibility of resolving conflicts by adding information. In this paper we investigate inconsistency in non-monotonic logics while taking this issue into account. In particular, we show that the well-known classical duality between hitting sets of minimal inconsistent subsets and maximal consistent subsets generalizes to arbitrary logics even if we allow adding novel information to a given knowledge base. We illustrate the versatility of the main theorems by covering more sophisticated situations and demonstrate how to utilize our results to analyze inconsistency in abstract argumentation. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1007/978-3-030-19570-0_10 | Lecture Notes in Artificial Intelligence |
Keywords | Field | DocType |
Non-monotonic reasoning,Inconsistency,Abstract argumentation | Monotonic function,Computer science,Argumentation theory,Theoretical computer science,Duality (optimization),Knowledge base | Conference |
Volume | ISSN | Citations |
11468 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Markus Ulbricht | 1 | 1 | 7.10 |