Papers¶
Contents:
To-read list¶
In argumentation:
Coalitions of arguments: A tool for handling bipolar argumentation frameworks
On the Gradual Acceptability of Arguments in Bipolar Weighted Argumentation Frameworks with Degrees of Trust
A Comparative Study of Ranking-based Semantics for Abstract Argumentation
Equational approach to argumentation networks
Argument Mining on Twitter: Arguments, Facts and Sources
Judgement aggregation in multi-agent argumentation
Credulous Acceptability, Poison Games and Modal Logic
Changing One’s Mind: Erase or Rewind? Possibilistic Belief Revision with Fuzzy Argumentation based on Trust
Capturing bipolar argumentation in non-flat assumption-based argumentation
Constructing and Evaluating Bipolar Weighted Argumentation Frameworks for Online Debating Systems
Gradual Semantics Accounting for Varied-Strength Attacks
Argumentation Semantics as Formal Discussion (Martin Caminada)
Fuzzy argumentation for trust
In TD:
Truth Discovery from Conflicting Multi-Valued Objects
Integrated and flexible framework for claim evaluation using credibility of sources
Constrained Truth Discovery
Automated evaluation of annotators for museum collections using subjective logic
Truth Discovery under Resource Constraints (PhD Thesis)
Truth Discovery by Claim and Source Embedding
On bayesian interpretation of fact-finding in information networks
Zencrowd: leveraging probabilistic reasoning and crowdsourcing techniques for large-scale entity linking.
People on drugs: Credibility of user statements in health communities
Content-driven trust propagation framework
Ensemble Classification Method Based on Truth Discovery
Learning the truth vector in high dimensions
Truth Discovery on Crowd Sensing of Correlated Entities
Whose vote should count more: optimal integration of labelers of unknown expertise
Automatic deception detection: Methods for finding fake news
Inferring Ground Truth From Crowdsourced Data Under Local Attribute Differential Privacy
A survey of trust in social networks, Sherchan
Truth Discovery via Proxy Voting
Knowledge-based trust: Estimating the trustworthiness of web sources
Neural network TD:
Truth discovery with memory network
Restricted Boltzmann Machines for Robust and Fast Latent Truth Discovery
Neural Network Architecture for Credibility Assessment of Textual Claims
A Neural Network Approach for Truth Discovery in Social Sensing
In social choice:
How Effective Can Simple Ordinal Peer Grading Be?
Generalized Decision Scoring Rules: Statistical, Computational, and Axiomatic Properties
Collective annotation of linguistic resources
Better human computation through principled voting
Graph aggregation, Endriss and Grandi
In belief revision:
The basic principles of uncertain information fusion. An organised review of merging rules in different representation frameworks
Logic-based approaches to information fusion
Logic Based Merging
Social choice theory, belief merging, and strategy-proofness
Belief merging versus Judgment Aggregation
Others:
Belief, information acquisition, and trust in multi agent systems – A modal logic formulation
The logic of justification
Truthful mobile crowd sensing with interdependent valuations
References¶
- AEMO20
Tahar Allouche, Bruno Escoffier, Stefano Moretti, and Meltem Öztürk. Social ranking manipulability for the cp-majority, banzhaf and lexicographic excellence solutions. In Christian Bessiere, editor, Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI-20, 17–23. International Joint Conferences on Artificial Intelligence Organization, 7 2020. Main track. URL: https://doi.org/10.24963/ijcai.2020/3, doi:10.24963/ijcai.2020/3.
- ABN13
Leila Amgoud and Jonathan Ben-Naim. Ranking-based semantics for argumentation frameworks. In Weiru Liu, V. S. Subrahmanian, and Jef Wijsen, editors, Scalable Uncertainty Management, 134–147. Berlin, Heidelberg, 2013. Springer Berlin Heidelberg.
- AD14
Leila Amgoud and Robert Demolombe. An argumentation-based approach for reasoning about trust in information sources. Argument & Computation, 5(2-3):191–215, 2014.
- AndjelicAC+15
M. An\dj elić, E. Andrade, D.M. Cardoso, C.M. da Fonseca, S.K. Simić, and D.V. Tošić. Some new considerations about double nested graphs. Linear Algebra and its Applications, 483:323–341, oct 2015. URL: https://doi.org/10.1016%2Fj.laa.2015.06.010, doi:10.1016/j.laa.2015.06.010.
- BGS16
Alexandru Baltag, Nina Gierasimczuk, and Sonja Smets. On the solvability of inductive problems: a study in epistemic topology. Electronic Proceedings in Theoretical Computer Science, 215:81–98, Jun 2016. URL: http://dx.doi.org/10.4204/EPTCS.215.7, doi:10.4204/eptcs.215.7.
- BGS19
Alexandru Baltag, Nina Gierasimczuk, and Sonja Smets. Truth-Tracking by Belief Revision. Studia Logica, 107(5):917–947, October 2019. URL: https://doi.org/10.1007/s11225-018-9812-x, doi:10.1007/s11225-018-9812-x.
- BS08
Alexandru Baltag and Sonja Smets. A qualitative theory of dynamic interactive belief revision. Logic and the foundations of game and decision theory (LOFT 7), 3:9–58, 2008.
- BRT19
Pietro Baroni, Antonio Rago, and Francesca Toni. From fine-grained properties to broad principles for gradual argumentation: a principled spectrum. International Journal of Approximate Reasoning, 105:252 – 286, 2019. URL: http://www.sciencedirect.com/science/article/pii/S0888613X18304651, doi:https://doi.org/10.1016/j.ijar.2018.11.019.
- BVB07
Patrick Blackburn and Johan Van Benthem. Modal logic: a semantic perspective. In Studies in Logic and Practical Reasoning, volume 3, pages 1–84. Elsevier, 2007.
- BGvdTV10
Guido Boella, Dov Gabbay, Leon van der Torre, and S. Villata. Support in abstract argumentation. Proceedings of COMMA 2010, pages 40–51, 01 2010.
- Bon05
Giacomo Bonanno. A simple modal logic for belief revision. Synthese, 147(2):193–228, 2005.
- BH18
Richard Booth and Aaron Hunter. Trust as a Precursor to Belief Revision. J. Artif. Intell. Res., 61:699–722, 2018.
- BBH16
Felix Brandt, Markus Brill, and Bernhard Harrenstein. Tournament solutions. Handbook of Computational Social Choice, 2016.
- BCE+16
Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia. Handbook of Computational Social Choice. Cambridge University Press, 2016.
- BVazquezCCDiazRGonzalezDiaz08
Miguel Brozos-Vázquez, Marco Antonio Campo-Cabana, José Carlos D’ıaz-Ramos, and Julio González-D’ıaz. Ranking participants in tournaments by means of rating functions. Journal of Mathematical Economics, 44(11):1246–1256, dec 2008. URL: https://doi.org/10.1016%2Fj.jmateco.2008.03.002, doi:10.1016/j.jmateco.2008.03.002.
- CS17
Martin Caminada and Chiaki Sakama. On the issue of argumentation and informedness. In New Frontiers in Artificial Intelligence, pages 317–330. Springer International Publishing, 2017. URL: https://doi.org/10.1007%2F978-3-319-50953-2_22, doi:10.1007/978-3-319-50953-2_22.
- CKV16
Ioannis Caragiannis, George A. Krimpas, and Alexandros A. Voudouris. How effective can simple ordinal peer grading be? In Proceedings of the 2016 ACM Conference on Economics and Computation, EC ’16, 323–340. New York, NY, USA, 2016. Association for Computing Machinery. URL: https://doi.org/10.1145/2940716.2940748, doi:10.1145/2940716.2940748.
- CPS16
Ioannis Caragiannis, Ariel D. Procaccia, and Nisarg Shah. When do noisy votes reveal the truth? ACM Trans. Econ. Comput., March 2016. URL: https://doi.org/10.1145/2892565, doi:10.1145/2892565.
- CLS05a
C. Cayrol and M. C. Lagasquie-Schiex. Gradual valuation for bipolar argumentation frameworks. In Lluís Godo, editor, Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 366–377. Berlin, Heidelberg, 2005. Springer Berlin Heidelberg.
- CLS05b
C. Cayrol and M. C. Lagasquie-Schiex. On the Acceptability of Arguments in Bipolar Argumentation Frameworks. In Lluís Godo, editor, Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 378–389. Berlin, Heidelberg, 2005. Springer Berlin Heidelberg.
- CLagasquieSchiex13
Claudette Cayrol and Marie-Christine Lagasquie-Schiex. Bipolarity in argumentation graphs: towards a better understanding. Int. J. Approx. Reasoning, 54(7):876–899, 2013. URL: https://doi.org/10.1016/j.ijar.2013.03.001, doi:10.1016/j.ijar.2013.03.001.
- Cev14
Gustavo Cevolani. Truth approximation, belief merging, and peer disagreement. Synthese, 191(11):2383–2401, 2014.
- CS99
Pavel Yu. Chebotarev and Elena Shamis. Preference fusion when the number of alternatives exceeds two: indirect scoring procedures. Journal of the Franklin Institute, 336(2):205–226, mar 1999. URL: https://doi.org/10.1016%2Fs0016-0032%2898%2900017-9, doi:10.1016/s0016-0032(98)00017-9.
- CRC15
Niall J. Conroy, Victoria L. Rubin, and Yimin Chen. Automatic deception detection: methods for finding fake news. Proceedings of the Association for Information Science and Technology, 52(1):1–4, 2015. URL: https://asistdl.onlinelibrary.wiley.com/doi/abs/10.1002/pra2.2015.145052010082, arXiv:https://asistdl.onlinelibrary.wiley.com/doi/pdf/10.1002/pra2.2015.145052010082, doi:10.1002/pra2.2015.145052010082.
- CI15
David Cook II. Nested colorings of graphs. AUSTRALASIAN JOURNAL OF COMBINATORICS, 62(1):100–127, 2015.
- Cro05
Martin D. Crossley. Essential Topology. Springer London, 2005. URL: https://doi.org/10.1007%2F1-84628-194-6, doi:10.1007/1-84628-194-6.
- Csato19
László Csató. An impossibility theorem for paired comparisons. Central European Journal of Operations Research, 27(2):497–514, 2019.
- DDKR13
Nilesh Dalvi, Anirban Dasgupta, Ravi Kumar, and Vibhor Rastogi. Aggregating crowdsourced binary ratings. In Proceedings of the 22nd International Conference on World Wide Web, WWW ‘13, 285–294. New York, NY, USA, 2013. Association for Computing Machinery. URL: https://doi.org/10.1145/2488388.2488414, doi:10.1145/2488388.2488414.
- DP97
Adnan Darwiche and Judea Pearl. On the logic of iterated belief revision. Artificial Intelligence, 89(1-2):1–29, jan 1997. URL: https://doi.org/10.1016%2Fs0004-3702%2896%2900038-0, doi:10.1016/s0004-3702(96)00038-0.
- DS79
A. P. Dawid and A. M. Skene. Maximum likelihood estimation of observer error-rates using the EM algorithm. Applied Statistics, 28(1):20, 1979. URL: https://doi.org/10.2307%2F2346806, doi:10.2307/2346806.
- DPW18
James P Delgrande, Pavlos Peppas, and Stefan Woltran. General belief revision. Journal of the ACM (JACM), 65(5):1–34, 2018.
- DGX16
Hu Ding, Jing Gao, and Jinhui Xu. Finding global optimum for truth discovery: entropy based geometric variance. In Proc. 32nd International Symposium on Computational Geometry (SoCG 2016). 2016.
- DDLS15
Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, and Blair D Sullivan. On the threshold of intractability. In Algorithms-ESA 2015, pages 411–423. Springer, 2015.
- EKM+10
Patricia Everaere, Sébastien Konieczny, Pierre Marquis, and others. The epistemic view of belief merging: can we track the truth?. In ECAI, 621–626. 2010.
- FMHV03
Ronald Fagin, Yoram Moses, Joseph Y Halpern, and Moshe Y Vardi. Reasoning about knowledge. MIT press, 2003.
- For57
L. R. Ford. Solution of a ranking problem from binary comparisons. The American Mathematical Monthly, 64(8P2):28–33, oct 1957. URL: https://doi.org/10.1080%2F00029890.1957.11989117, doi:10.1080/00029890.1957.11989117.
- GK17
Konstantin Genin and Kevin T Kelly. The topology of statistical verifiability. arXiv preprint arXiv:1707.09378, 2017.
- GKM11
Arpita Ghosh, Satyen Kale, and Preston McAfee. Who moderates the moderators? In Proceedings of the 12th ACM conference on Electronic commerce - EC \textquotesingle 11. ACM Press, 2011. URL: https://doi.org/10.1145%2F1993574.1993599, doi:10.1145/1993574.1993599.
- GonzalezDiazHL14
Julio González-Díaz, Ruud Hendrickx, and Edwin Lohmann. Paired comparisons analysis: an axiomatic approach to ranking methods. Social Choice and Welfare, 42(1):139–169, 2014.
- GP92
VALENTIN GORANKO and SOLOMON PASSY. Using the universal modality: gains and questions. Journal of Logic and Computation, 2(1):5–30, 1992. URL: https://doi.org/10.1093%2Flogcom%2F2.1.5, doi:10.1093/logcom/2.1.5.
- HKP+20
Daniel Halpern, Gregory Kehne, Dominik Peters, Ariel D Procaccia, Nisarg Shah, and Piotr Skowron. Aggregating binary judgments ranked by accuracy. ?, 2020.
- HKMO18
Adrian Haret, Hossein Khani, Stefano Moretti, and Meltem Ozturk. Ceteris paribus majority for social ranking. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18. 2018.
- HS12
Stephan Hartmann and Jan Sprenger. Judgment aggregation and the problem of tracking the truth. Synthese, 187(1):209–221, July 2012. URL: https://doi.org/10.1007/s11229-011-0031-5, doi:10.1007/s11229-011-0031-5.
- Hen85
D. Henriet. The copeland choice function an axiomatic characterization. Social Choice and Welfare, 2(1):49–63, may 1985. URL: https://doi.org/10.1007%2Fbf00433767, doi:10.1007/bf00433767.
- JDCV08
Jeroen Janssen, Martine De Cock, and Dirk Vermeir. Fuzzy argumentation frameworks. In Information processing and management of uncertainty in knowledge-based systems, 513–520. 2008.
- JRG17
Yang Jiao, R Ravi, and Wolfgang Gatterbauer. Algorithms for automatic ranking of participants and tasks in an anonymized contest. In International Workshop on Algorithms and Computation, 335–346. Springer, 2017.
- KOS13
David R. Karger, Sewoong Oh, and Devavrat Shah. Efficient crowdsourcing for multi-class labeling. In Proceedings of the ACM SIGMETRICS/International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS ‘13, 81–92. New York, NY, USA, 2013. Association for Computing Machinery. URL: https://doi.org/10.1145/2465529.2465761, doi:10.1145/2465529.2465761.
- KSH97
Kevin Kelly, Oliver Schulte, and Vincent Hendricks. Reliable belief revision. In Logic and Scientific Methods, pages 383–398. Springer, 1997.
- Kle99
Jon M. Kleinberg. Authoritative Sources in a Hyperlinked Environment. J. ACM, 46(5):604–632, September 1999. URL: http://doi.acm.org/10.1145/324133.324140, doi:10.1145/324133.324140.
- KPerez08
Sébastien Konieczny and Ramón Pino Pérez. Improvement operators. In KR, 177–187. 2008.
- KEFQ14
Justin Kruger, Ulle Endriss, Raquel Fernandez, and Ciyang Qing. Axiomatic Analysis of Aggregation Methods for Collective Annotation. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, AAMAS ‘14, 1185–1192. Richland, SC, 2014. International Foundation for Autonomous Agents and Multiagent Systems. event-place: Paris, France. URL: http://dl.acm.org/citation.cfm?id=2617388.2617437.
- LLG+14
Qi Li, Yaliang Li, Jing Gao, Lu Su, Bo Zhao, Murat Demirbas, Wei Fan, and Jiawei Han. A confidence-aware approach for truth discovery on long-tail data. Proc. VLDB Endow., 8(4):425–436, December 2014. URL: https://doi.org/10.14778/2735496.2735505, doi:10.14778/2735496.2735505.
- LLG+16
Yaliang Li, Qi Li, Jing Gao, Lu Su, Bo Zhao, Wei Fan, and Jiawei Han. Conflicts to Harmony: A Framework for Resolving Conflicts in Heterogeneous Data by Truth Discovery. IEEE Transactions on Knowledge and Data Engineering, 28(8):1986–1999, August 2016. doi:10.1109/TKDE.2016.2559481.
- MSH20
Christoph Merdes, Momme Sydow, and Ulrike Hahn. Formal models of source reliability. Synthese, pages in press, 02 2020.
- Moo15
John W Moon. Topics on tournaments in graph theory. Courier Dover Publications, 2015.
- MN18
Till Mossakowski and Fabian Neuhaus. Modular semantics and characteristics for bipolar weighted argumentation graphs. 2018. arXiv:1807.06685.
- NSS00
Assaf Natanzon, Ron Shamir, and Roded Sharan. A polynomial approximation algorithm for the minimum fill-in problem. SIAM Journal on Computing, 30(4):1067–1079, 2000.
- NSS01
Assaf Natanzon, Ron Shamir, and Roded Sharan. Complexity classification of some edge modification problems. Discrete Applied Mathematics, 113(1):109–128, 2001.
- NP82
Shmuel Nitzan and Jacob Paroush. Optimal decision rules in uncertain dichotomous choice situations. International Economic Review, pages 289–297, 1982.
- OBB+18
Catherine Olsson, Surya Bhupatiraju, Tom Brown, Augustus Odena, and Ian Goodfellow. Skill rating for generative models. arXiv preprint arXiv:1808.04888, 2018.
- Pac17
Eric Pacuit. Neighborhood semantics for modal logic. Springer, 2017.
- PTS+11
Simon Parsons, Yuqing Tang, Elizabeth Sklar, Peter McBurney, and Kai Cai. Argumentation-based reasoning in agents with varying degrees of trust. In The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, AAMAS ‘11, 879–886. Richland, SC, 2011. International Foundation for Autonomous Agents and Multiagent Systems. URL: http://dl.acm.org/citation.cfm?id=2031678.2031743.
- PR10
Jeff Pasternack and Dan Roth. Knowing What to Believe (when You Already Know Something). In Proceedings of the 23rd International Conference on Computational Linguistics, COLING ‘10, 877–885. Stroudsburg, PA, USA, 2010. Association for Computational Linguistics. event-place: Beijing, China. URL: http://dl.acm.org/citation.cfm?id=1873781.1873880.
- Pla07
Jan Plaza. Logics of public communications. Synthese, 158(2):165–179, 2007.
- Rub80
Ariel Rubinstein. Ranking the participants in a tournament. SIAM Journal on Applied Mathematics, 38(1):108–111, 1980.
- SV05
Giora Slutzki and Oscar Volij. Ranking participants in generalized tournaments. International Journal of Game Theory, 33(2):255–270, 2005.
- vDvdHK08
Hans van Ditmarsch, Wiebe van der Hoek, and Barteld Kooi. Dynamic Epistemic Logic. Springer Netherlands, 2008. URL: https://doi.org/10.1007%2F978-1-4020-5839-4, doi:10.1007/978-1-4020-5839-4.
- WKLA12
Dong Wang, Lance Kaplan, Hieu Le, and Tarek Abdelzaher. On Truth Discovery in Social Sensing: A Maximum Likelihood Estimation Approach. In Proceedings of the 11th International Conference on Information Processing in Sensor Networks, IPSN ‘12, 233–244. New York, NY, USA, 2012. ACM. event-place: Beijing, China. URL: http://doi.acm.org/10.1145/2185677.2185737, doi:10.1145/2185677.2185737.
- XGW+16
Houping Xiao, Jing Gao, Zhaoran Wang, Shiyu Wang, Lu Su, and Han Liu. A Truth Discovery Approach with Theoretical Guarantee. In Proceedings of the 22Nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ‘16, 1925–1934. New York, NY, USA, 2016. ACM. event-place: San Francisco, California, USA. URL: http://doi.acm.org/10.1145/2939672.2939816, doi:10.1145/2939672.2939816.
- Yan16
Ting Yan. Ranking in the generalized bradley–terry models when the strong connection condition fails. Communications in Statistics-Theory and Methods, 45(2):340–353, 2016.
- Yan81a
Mihalis Yannakakis. Computing the minimum fill-in is np-complete. SIAM Journal on Algebraic Discrete Methods, 2(1):77–79, 1981.
- Yan81b
Mihalis Yannakakis. Node-deletion problems on bipartite graphs. SIAM Journal on Computing, 10(2):310–327, 1981.
- ZhangShengLiWu18
J. Zhang, V. S. Sheng, T. Li, and X. Wu. Improving crowdsourced label quality using noise correction. IEEE Transactions on Neural Networks and Learning Systems, 29(5):1675–1688, May 2018. doi:10.1109/TNNLS.2017.2677468.