Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Abstract argumentation with Markov Networks

Potyka, Nico 2020. Abstract argumentation with Markov Networks. Presented at: 24th European Conference on Artificial Intelligence (ECAI 2020), Santiago de Compostela, Spain, 8/06/2020 -12/06/2020. Frontiers in Artificial Intelligence and Applications. , vol.325 ECAI 2020, pp. 865-872. 10.3233/FAIA200177

Full text not available from this repository.


We explain how abstract argumentation problems can be encoded as Markov networks. From a computational perspective, this allows reducing argumentation tasks like finding labellings or deciding credulous and sceptical acceptance to probabilistic inference tasks in Markov networks. From a semantical perspective, the resulting probabilistic argumentation models are interesting in their own right. In particular, they satisfy several of the properties proposed for epistemic probabilistic argumentation by Hunter and Thimm. We also consider an extension to frameworks with deductive support and show that it maintains many of the interesting guarantees of both approaches .

Item Type: Conference or Workshop Item (Paper)
Status: Published
Schools: Computer Science & Informatics
Publisher: ECAI 2020
ISBN: 978-1-64368-100-9
Last Modified: 27 Jun 2023 10:45

Actions (repository staff only)

Edit Item Edit Item