As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Value-based argumentation frameworks, as introduced by Bench-Capon, allow the abstract representation of persuasive argumentation. This formalism takes into account the relative strength of arguments with respect to some ordering which represents an audience. Deciding subjective or objective acceptance (i.e., acceptance with respect to at least one or with respect to all orderings) are intractable computational problems.
In this paper we study the computational complexity of testing the subjective or objective acceptance for problem instances that obey certain restrictions. We consider structural restrictions in terms of the underlying graph structure of the value-based argumentation framework and in terms of properties of the equivalence relation formed by arguments with the same relative strength. We identify new tractable fragments where subjective and objective acceptance can be tested in polynomial time. Furthermore we show the intractability of some fragments that are located at the boundary to tractability. Our results disprove two conjectures of Dunne (Artificial Intelligence 171, 2007).
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.