稳健性
论证理论
计算机科学
完备性(序理论)
论证框架
论证(复杂分析)
扩展(谓词逻辑)
理论计算机科学
语义学(计算机科学)
集合(抽象数据类型)
人工智能
认识论
数学
程序设计语言
哲学
化学
数学分析
生物化学
作者
Quratul-ain Mahesar,Nir Oren,Wamberto Vasconcelos
标识
DOI:10.1007/978-3-030-03098-8_24
摘要
We present an extension-based approach for computing preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets of arguments from an argumentation framework, there is a lack of justification behind their acceptability based on implicit argument preferences. This paper presents a novel algorithm for exhaustively computing and enumerating all possible sets of preferences for a conflict-free set of arguments in an abstract argumentation framework. We prove the soundness and completeness of the algorithm. The research establishes that preferences are determined using an extension-based approach after the evaluation phase (acceptability of arguments) rather than stated beforehand. We also present some novel insights by comparing the computed preferences for the extensions.
科研通智能强力驱动
Strongly Powered by AbleSci AI