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

Probabilistic abstract dialectical frameworks

Polberg, Sylwia and Doder, Dragan 2014. Probabilistic abstract dialectical frameworks. Lecture Notes in Computer Science 8761 , pp. 591-599. 10.1007/978-3-319-11558-0_42

[img]
Preview
PDF - Accepted Post-Print Version
Download (316kB) | Preview

Abstract

Although Dung’s frameworks are widely approved tools for abstract argumentation, their abstractness makes expressing notions such as support or uncertainty very difficult. Thus, many of their generalizations were created, including the probabilistic argumentation frameworks (PrAFs) and the abstract dialectical frameworks (ADFs). While the first allow modeling uncertain arguments and attacks, the latter can handle various dependencies between arguments. Although the actual probability layer in PrAFs is independent of the chosen semantics, new relations pose new challenges and new interpretations of what is the probability of a relation. Thus, the methodology for handling uncertainties cannot be shifted to more general structures without any further thought. In this paper we show how ADFs are extended with probabilities.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Publisher: Springer
ISSN: 0302-9743
Funders: Vienna PhD School of Informatics, FWF, National Research Fund (FNR) Luxembourg
Date of First Compliant Deposit: 12 March 2019
Date of Acceptance: 5 July 2014
Last Modified: 29 Jun 2019 13:44
URI: http://orca.cf.ac.uk/id/eprint/120620

Citation Data

Cited 19 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics