Reference : Probabilistic Abstract Argumentation Based on SCC Decomposability
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/37873
Probabilistic Abstract Argumentation Based on SCC Decomposability
English
Rienstra, Tjitze [> >]
Thimm, Matthias [> >]
Liao, Beishui mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
van der Torre, Leon mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
2018
Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona 30 October - 2 November 2018.
Yes
Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2018)
October 27 - November 2 2018
[en] In this paper we introduce a new set of general principles for probabilistic abstract argumentation. The main principle is a probabilistic analogue of SCC decomposability, which ensures that the probabilistic evaluation of an argumentation framework complies with the probabilistic (in)dependencies implied by the graph topology. We introduce various examples of probabilistic semantics and determine which principles they satisfy. Our work also provides new insights into the relationship between abstract argumentation and the theory of Bayesian networks.
http://hdl.handle.net/10993/37873
https://aaai.org/ocs/index.php/KR/KR18/paper/view/18023
168--177

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
18023-78637-1-PB.pdfPublisher postprint613.41 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.