Towards fixed-parameter tractable algorithms for abstract argumentation
نویسندگان
چکیده
Article history: Received 16 June 2011 Received in revised form 1 February 2012 Accepted 11 March 2012 Available online 13 March 2012
منابع مشابه
Computational Aspects of Abstract Argumentation
This work is in the context of formal argumentation, a sub-field of Artificial Intelligence. Probably the most popular formalism in argumentation is abstract argumentation as introduced by Dung [42]. So called abstract argumentation frameworks abstract from the actual content of arguments and represent them as abstract entities and further abstract from the reasons of conflicts between argument...
متن کاملAugmenting Tractable Fragments of Abstract Argumentation
We present a new and compelling approach to the efficient solution of important computational problems that arise in the context of abstract argumentation. Our approach makes known algorithms defined for restricted fragments generally applicable, at a computational cost that scales with the distance from the fragment. Thus, in a certain sense, we gradually augment tractable fragments. Surprisin...
متن کاملTowards Fixed-Parameter Tractable Algorithms for Argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have been identified. In particular, Dunne showed that many problems can be solved in linear time for argumentation frameworks of bounded tree-width. However, these tractability results, which were obtained via Courcelle’s Th...
متن کاملReasoning in Argumentation Frameworks of Bounded Clique-Width
Most computational problems in the area of abstract argumentation are intractable, thus identifying tractable fragments and developing efficient algorithms for such fragments are important objectives towards practically efficient argumentation systems. One approach to tractability is to view abstract argumentation frameworks (AFs) as directed graphs and bound certain graph parameters. In partic...
متن کاملStage semantics and the SCC-recursive schema for argumentation semantics
Recently, stage and cf2 semantics for abstract argumentation attracted specific attention. By distancing from the notion of defense, they are capable to select arguments out of odd-length cycles. In case of cf2 semantics, the SCC-recursive schema guarantees that important evaluation criteria for argumentation semantics, like directionality, weakand CF -reinstatement, are fulfilled. Beside sever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Artif. Intell.
دوره 186 شماره
صفحات -
تاریخ انتشار 2012