Belief Merging by Source Reliability Assessment

Merging beliefs requires the plausibility of the sources of the information to be merged. They are typically assumed equally reliable in lack of hints indicating otherwise; yet, a recent line of research spun from the idea of deriving this information from the revision process itself. In particular, the history of previous revisions and previous merging examples provide information for performing subsequent mergings. Yet, no examples or previous revisions may be available. In spite of the apparent lack of information, something can still be inferred by a try-and-check approach: a relative reliability ordering is assumed, the merging process is performed based on it, and the result is compared with the original information. The outcome of this check may be incoherent with the initial assumption, like when a completely reliable source is rejected some of the information it provided. In such cases, the reliability ordering assumed in the first place can be excluded from consideration. The first theorem of this article proves that such a scenario is indeed possible. Other results are obtained under various definition of reliability and merging.

[1]  Martin Wattenberg,et al.  Proceedings of the 40th Hawaii International Conference on System Sciences- 2007 Talk Before You Type: Coordination in Wikipedia , 2022 .

[2]  Andreas Herzig,et al.  Belief Merging in Dynamic Logic of Propositional Assignments , 2014, FoIKS.

[3]  Premkumar T. Devanbu,et al.  Mining Stack Exchange: Expertise Is Evident from Initial Contributions , 2012, 2012 International Conference on Social Informatics.

[4]  Richard Booth,et al.  Reconstructing an Agent's Epistemic State from Observations , 2005, IJCAI.

[5]  Ahmed E. Hassan,et al.  What are developers talking about? An analysis of topics and trends in Stack Overflow , 2014, Empirical Software Engineering.

[6]  Bernhard Nebel,et al.  How Hard is it to Revise a Belief Base , 1996 .

[7]  Sébastien Konieczny,et al.  Logic Based Merging , 2011, J. Philos. Log..

[8]  Sébastien Konieczny,et al.  Merging with Integrity Constraints , 1999, ESCQARU.

[9]  Marco Schaerf,et al.  Arbitration (or How to Merge Knowledge Bases) , 1998, IEEE Trans. Knowl. Data Eng..

[10]  D Sines,et al.  A decade of development. , 1997, Nursing standard (Royal College of Nursing (Great Britain) : 1987).

[11]  Paolo Liberatore,et al.  Revision History , 1995 .

[12]  Lada A. Adamic,et al.  Knowledge sharing and yahoo answers: everyone knows something , 2008, WWW.

[13]  Adrian Haret,et al.  Distributing Knowledge into Simple Bases , 2016, IJCAI.

[14]  Paolo Liberatore,et al.  Belief Merging by Examples , 2014, ACM Trans. Comput. Log..

[15]  Sébastien Konieczny,et al.  Distance Based Merging: A General Framework and some Complexity Results , 2002, KR.

[16]  Felix Naumann,et al.  Data Fusion in Three Steps: Resolving Schema, Tuple, and Value Inconsistencies , 2006, IEEE Data Eng. Bull..

[17]  Simon D'Alfonso Belief merging with the aim of truthlikeness , 2015, Synthese.

[18]  Sébastien Konieczny,et al.  DA2 merging operators , 2004, Artif. Intell..

[19]  Hans Rott Belief Contraction in the Context for the General Theory of Rational Choice , 1993, J. Symb. Log..

[20]  Sébastien Konieczny,et al.  Belief Merging versus Judgment Aggregation , 2015, AAMAS.

[21]  Didier Dubois,et al.  Iterated Revision as Prioritized Merging , 2006, KR.

[22]  Bernhard Nebel,et al.  Belief Revision: Syntax based approaches to belief revision , 1992 .

[23]  Gustavo Cevolani Truth approximation, belief merging, and peer disagreement , 2014, Synthese.