论文标题
在计算抽象论证框架的稳定扩展方面
On Computing Stable Extensions of Abstract Argumentation Frameworks
论文作者
论文摘要
\ textIt {Abstract Compentation Framework}（{\ sc af}的简称）是一个有向图$（a，r）$，其中$ a $是一组\ textit {Abstract grib griments}和$ r \ subseteq a \ subseteq a \ times a $ $是\ textit {textit {attaint}的关系。令$ h =（a，r）$为{\ sc af}，$ s \ subseteq a $是一组参数，$ s^+ = \ {y \ {y \ nid \ nim mid \ evenists x \ in s \ text {with} with}（x，x，y）\ in r \} $ in s \ text {with}（x，y）\。然后，$ s $是$ h $ in $ h $的\ textit {stable Extension}，仅当$ s^+ = a \ setminus s $。在本文中，我们对已知的回溯算法进行了彻底的正式验证，用于列出给定{\ sc af}中所有稳定扩展。
An \textit{abstract argumentation framework} ({\sc af} for short) is a directed graph $(A,R)$ where $A$ is a set of \textit{abstract arguments} and $R\subseteq A \times A$ is the \textit{attack} relation. Let $H=(A,R)$ be an {\sc af}, $S \subseteq A$ be a set of arguments and $S^+ = \{y \mid \exists x\in S \text{ with }(x,y)\in R\}$. Then, $S$ is a \textit{stable extension} in $H$ if and only if $S^+ = A\setminus S$. In this paper, we present a thorough, formal validation of a known backtracking algorithm for listing all stable extensions in a given {\sc af}.
