On the Conditional Preference-based Argumentation Framework

Dung’s abstract Argumentation Framework (AF) has emerged as a central formalism in the area of knowledge representation and reasoning. Preferences in AF allow to represent the comparative strength of arguments in a simple yet expressive way. Preference-based AF (PAF) has been proposed to extend AF with preferences of the form 𝑎 > 𝑏, whose intuitive meaning is that argument 𝑎 is better than 𝑏. In this paper we discuss the recently proposed Conditional Preference-based Argumentation Framework (CPAF) [1] that extends PAF by introducing conditional preferences of the form 𝑎 > 𝑏 ← 𝑏𝑜𝑑𝑦 informally stating that 𝑎 is better than 𝑏 whenever the condition expressed by 𝑏𝑜𝑑𝑦 is true. We discuss CPAF properties and complexity results of the well-known verification and acceptance problems under multiple-status argumentation semantics.

Authors

• Gianvincenzo Alfano
• Sergio Greco
• Francesco Parisi
• Irina Trubitsyna

Keywords

• Abstract Argumentation
• Conditional Preferences
• Computational Complexity