Dung's Argumentation Framework (AF) has been extended in several directions. An interesting extension, among others, is the Epistemic Argumentation Framework (EAF) which allows representing the agent's belief by means of epistemic constraints. An epistemic constraint is a propositional formula over labeled arguments (e.g. in(a)) extended with the modal operators K andMthat intuitively state that the agent believes that a given formula is certainly or possibly true, respectively. In this paper, we discuss interesting results recently presented in [1] concerning the complexity of three canonical argumentation problems (i.e. verification, existence, and non-empty existence) in the context of EAF as well as the relationship between EAF and incomplete AF, an extension of AF where arguments and attacks may be uncertain.
On the Verification and Existence Problems in Epistemic Argumentation Framework
Alfano G.;Greco S.;Mandaglio D.;Parisi F.;Trubitsyna I.
2023-01-01
Abstract
Dung's Argumentation Framework (AF) has been extended in several directions. An interesting extension, among others, is the Epistemic Argumentation Framework (EAF) which allows representing the agent's belief by means of epistemic constraints. An epistemic constraint is a propositional formula over labeled arguments (e.g. in(a)) extended with the modal operators K andMthat intuitively state that the agent believes that a given formula is certainly or possibly true, respectively. In this paper, we discuss interesting results recently presented in [1] concerning the complexity of three canonical argumentation problems (i.e. verification, existence, and non-empty existence) in the context of EAF as well as the relationship between EAF and incomplete AF, an extension of AF where arguments and attacks may be uncertain.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
