کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
9649995 658455 2005 49 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
SCC-recursiveness: a general schema for argumentation semantics
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
SCC-recursiveness: a general schema for argumentation semantics
چکیده انگلیسی
In argumentation theory, Dung's abstract framework provides a unifying view of several alternative semantics based on the notion of extension. In this context, we propose a general recursive schema for argumentation semantics, based on decomposition along the strongly connected components of the argumentation framework. We introduce the fundamental notion of SCC-recursiveness and we show that all Dung's admissibility-based semantics are SCC-recursive, and therefore a special case of our schema. On these grounds, we argue that the concept of SCC-recursiveness plays a fundamental role in the study and definition of argumentation semantics. In particular, the space of SCC-recursive semantics provides an ideal basis for the investigation of new proposals: starting from the analysis of several examples where Dung's preferred semantics gives rise to questionable results, we introduce four novel SCC-recursive semantics, able to overcome the limitations of preferred semantics, while differing in other respects.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Artificial Intelligence - Volume 168, Issues 1–2, October 2005, Pages 162-210
نویسندگان
, , ,