On the measure of conflicts: Shapley Inconsistency Values

被引:109
作者
Hunter, Anthony [1 ]
Konieczny, Sebastien [2 ]
机构
[1] UCL, Dept Comp Sci, London WC1E 6BT, England
[2] Univ Artois, CRIL, CNRS, Lens, France
基金
英国工程与自然科学研究理事会;
关键词
Inconsistency management; Inconsistency tolerance; Inconsistency measures; Conflict resolution; Paraconsistency; Shapley values; REVISION; CONTRACTION; LOGIC;
D O I
10.1016/j.artint.2010.06.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
There are relatively few proposals for inconsistency measures for propositional belief bases. However inconsistency measures are potentially as important as information measures for artificial intelligence, and more generally for computer science. In particular, they can be useful to define various operators for belief revision, belief merging, and negotiation. The measures that have been proposed so far can be split into two classes. The first class of measures takes into account the number of formulae required to produce an inconsistency: the more formulae required to produce an inconsistency, the less inconsistent the base. The second class takes into account the proportion of the language that is affected by the inconsistency: the more propositional variables affected, the more inconsistent the base. Both approaches are sensible, but there is no proposal for combining them. We address this need in this paper: our proposal takes into account both the number of variables affected by the inconsistency and the distribution of the inconsistency among the formulae of the base. Our idea is to use existing inconsistency measures in order to define a game in coalitional form, and then to use the Shapley value to obtain an inconsistency measure that indicates the responsibility/contribution of each formula to the overall inconsistency in the base. This allows us to provide a more reliable image of the belief base and of the inconsistency in it. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1007 / 1026
页数:20
相关论文
共 55 条
[1]   ON THE LOGIC OF THEORY CHANGE - PARTIAL MEET CONTRACTION AND REVISION FUNCTIONS [J].
ALCHOURRON, CE ;
GARDENFORS, P ;
MAKINSON, D .
JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (02) :510-530
[2]  
[Anonymous], 2004, Lecture Notes in Computer Science
[3]  
[Anonymous], P 25 C UNC ART INT U
[4]  
[Anonymous], P KR 06
[5]  
[Anonymous], 1994, Handbook of Logic in Artificial Intelligence and Logic Programming. Ed. by
[6]  
AUMANN RJ, 2002, HDB GAME THEORY EC A, V3
[7]  
BARRAGANSMARTIN.B, 2005, P IEEE AUSTR SOFTW E
[8]   Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: A Comparative Study Part 1: the Flat Case [J].
Benferhat S. ;
Dubois D. ;
Prade H. .
Studia Logica, 1997, 58 (1) :17-45
[9]  
BENFERHAT S, 1993, P 9 C UNC ART INT, P411
[10]  
BOOTH R, 2001, P 8 C THEOR ASP RAT, P137