Abstract Dialectical Frameworks (ADFs) generalize Dung's argumentation frameworks allowing various relationships among arguments to be expressed in a systematic way. We further generalize ADFs so as to accommodate arbitrary acceptance degrees for the arguments. This makes ADFs applicable in domains where both the initial status of arguments and their relationship are only insufficiently specified by Boolean functions. We define all standard ADF semantics for the weighted case, including grounded, preferred and stable semantics. We illustrate our approach using acceptance degrees from the unit interval and show how other valuation structures can be integrated. In each case it is sufficient to specify how the generalized acceptance conditions are represented by formulas, and to specify the information ordering underlying the characteristic ADF operator. We also present complexity results for problems related to weighted ADFs.
Association for the Advancement of Artificial Intelligence (AAAI)
volume
32
Tags
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 Brewka2018-zm
%A Brewka, Gerhard
%A Strass, Hannes
%A Wallner, Johannes
%A Woltran, Stefan
%D 2018
%I Association for the Advancement of Artificial Intelligence (AAAI)
%J Proc. Conf. AAAI Artif. Intell.
%K
%N 1
%T Weighted abstract Dialectical Frameworks
%V 32
%X Abstract Dialectical Frameworks (ADFs) generalize Dung's argumentation frameworks allowing various relationships among arguments to be expressed in a systematic way. We further generalize ADFs so as to accommodate arbitrary acceptance degrees for the arguments. This makes ADFs applicable in domains where both the initial status of arguments and their relationship are only insufficiently specified by Boolean functions. We define all standard ADF semantics for the weighted case, including grounded, preferred and stable semantics. We illustrate our approach using acceptance degrees from the unit interval and show how other valuation structures can be integrated. In each case it is sufficient to specify how the generalized acceptance conditions are represented by formulas, and to specify the information ordering underlying the characteristic ADF operator. We also present complexity results for problems related to weighted ADFs.
@article{Brewka2018-zm,
abstract = {Abstract Dialectical Frameworks (ADFs) generalize Dung's argumentation frameworks allowing various relationships among arguments to be expressed in a systematic way. We further generalize ADFs so as to accommodate arbitrary acceptance degrees for the arguments. This makes ADFs applicable in domains where both the initial status of arguments and their relationship are only insufficiently specified by Boolean functions. We define all standard ADF semantics for the weighted case, including grounded, preferred and stable semantics. We illustrate our approach using acceptance degrees from the unit interval and show how other valuation structures can be integrated. In each case it is sufficient to specify how the generalized acceptance conditions are represented by formulas, and to specify the information ordering underlying the characteristic ADF operator. We also present complexity results for problems related to weighted ADFs.},
added-at = {2024-09-10T11:56:37.000+0200},
author = {Brewka, Gerhard and Strass, Hannes and Wallner, Johannes and Woltran, Stefan},
biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2df0de2752763c45e8ac404331631fd1d/scadsfct},
interhash = {bc0028b2f905176097430c015ab7bd2b},
intrahash = {df0de2752763c45e8ac404331631fd1d},
journal = {Proc. Conf. AAAI Artif. Intell.},
keywords = {},
month = apr,
number = 1,
publisher = {Association for the Advancement of Artificial Intelligence (AAAI)},
timestamp = {2024-09-10T15:15:57.000+0200},
title = {Weighted abstract Dialectical Frameworks},
volume = 32,
year = 2018
}
