This paper develops an inconsistency measure on conditional probabilistic knowledge bases. The measure is based on fundamental principles for inconsistency measures and thus provides a solid theoretical framework for the treatment of inconsistencies in probabilistic expert systems. We illustrate its usefulness and immediate application on several examples and present some formal results. Building on this measure we use the Shapley value-a well-known solution for coalition games-to define a sophisticated indicator that is not only able to measure inconsistencies but to reveal the causes of inconsistencies in the knowledge base. Altogether these tools guide the knowledge engineer in his aim to restore consistency and therefore enable him to build a consistent and usable knowledge base that can be employed in probabilistic expert systems.
Measuring Inconsistency in Declarative Process Specifications
Institute for IS Research, University of Koblenz-Landau(科布伦茨-兰道大学信息系统研究所);University of Maryland, College Park(马里兰大学帕克分校);Artificial Intelligence Group, University of Hagen(哈根大学人工智能研究组)
Characterization of an inconsistency ranking for pairwise comparison matrices
Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)(匈牙利科学院计算机科学与控制研究所(MTA SZTAKI));Corvinus University of Budapest (BCE)(布达佩斯考文纽斯大学(BCE))
Measuring Rule-based LTLf Process Specifications: A Probabilistic Data-driven Approach
Vienna University of Economics and Business(维也纳经济与商业大学);Sapienza University of Rome, Department of Computer Science(罗马萨皮恩扎大学计算机科学系);York University, School of Information Technology (ITEC)(约克大学信息科技学院(ITEC))
TrustJudge: Inconsistencies of LLM-as-a-Judge and How to Alleviate Them
Peking University(北京大学);National University of Singapore(新加坡国立大学);Institute of Science Tokyo(东京科学研究院);Nanjing University(南京大学);Westlake University(西湖大学);Southeast University(东南大学)