Thimm, Matthias, Cerutti, Federico ORCID: https://orcid.org/0000-0003-0755-0358 and Rienstra, Tjitze 2018. Probabilistic graded semantics. Presented at: COMMA 2018: 7th International Conference on Computational Models of Argument, Warsaw, Poland, 12-14 September 2018. |
Preview |
PDF
- Accepted Post-Print Version
Download (175kB) | Preview |
Abstract
We propose a new graded semantics for abstract argumentation frameworks that is based on the constellations approach to probabilistic argumentation. Given an abstract argumentation framework, our approach assigns uniform probability to all arguments and then ranks arguments according to the probability of acceptance wrt. some classical semantics. Albeit relying on a simple idea this approach (1) is based on the solid theoretical foundations of probability theory, and (2) complies with many rationality postulates proposed for graded semantics. We also investigate an application of our approach for inconsistency measurement in argumentation frameworks and show that the measure induced by the probabilistic graded semantics also complies with the basic rationality postulates from that area.
Item Type: | Conference or Workshop Item (Speech) |
---|---|
Status: | In Press |
Schools: | Computer Science & Informatics Crime and Security Research Institute (CSURI) |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Funders: | DAIS-ITA |
Related URLs: | |
Date of First Compliant Deposit: | 16 August 2018 |
Last Modified: | 24 Oct 2022 07:08 |
URI: | https://orca.cardiff.ac.uk/id/eprint/114188 |
Citation Data
Cited 6 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
Edit Item |