首页/论文/0803.3812

arXiv 0803.38122008-03-26cs.AIcs.SC

Preferred extensions as stable models

Universitat Politècnica de Catalunya（加泰罗尼亚理工大学）；Universidad de las Américas - Puebla（普埃布拉美洲大学）

Juan Carlos Nieves, Mauricio Osorio, Ulises Cortés

备注：: 17 pages, 2 Figures; to appear in Theory and Practice of Logic Programming (TPLP)

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

英文摘要相关论文

英文摘要：

Given an argumentation framework AF, we introduce a mapping function that constructs a disjunctive logic program P, such that the preferred extensions of AF correspond to the stable models of P, after intersecting each stable model with the relevant atoms. The given mapping function is of polynomial size w.r.t. AF. In particular, we identify that there is a direct relationship between the minimal models of a propositional formula and the preferred extensions of an argumentation framework by working on representing the defeated arguments. Then we show how to infer the preferred extensions of an argumentation framework by using UNSAT algorithms and disjunctive stable model solvers. The relevance of this result is that we define a direct relationship between one of the most satisfactory argumentation semantics and one of the most successful approach of non-monotonic reasoning i.e., logic programming with the stable model semantics.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

论论证框架的优先外延：与朴素集合的双射关系

On the preferred extensions of argumentation frameworks: bijections with naive sets

Université de Bejaia（贝贾亚大学）；Université Clermont-Auvergne（克莱蒙奥弗涅大学）；CNRS（法国国家科学研究中心）；Mines de Saint-Étienne（圣艾蒂安国立高等矿业学校）；Clermont-Auvergne-INP（克莱蒙奥弗涅国立理工学院）；Univ Lyon（里昂大学）；INSA Lyon（里昂国立应用科学学院）；UCBL（里昂第一大学）；Centrale Lyon（里昂中央理工学院）；Univ Lyon 2（里昂第二大学）

本研究通过建立论证框架优先外延与不同框架朴素集合间的双射关系，分析三类框架的相关问题复杂度，并提出基于不可约自防御集的双射方法，实现特定格性质框架优先外延的多项式延迟与空间枚举。

2023-06-15cs.AIcs.DMmath.CO

On Computing Stable Extensions of Abstract Argumentation Frameworks

German Jordanian University（德国约旦大学）

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}.

2021-09-14cs.AIcs.DMcs.DS

Stable Models for Infinitary Formulas with Extensional Atoms

University of Texas（德克萨斯大学）

The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used to reason about infinitary definitions. This note is under consideration for publication in Theory and Practice of Logic Programming.

2016-08-04cs.AIcs.LO

Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach

University of Aberdeen（阿伯丁大学）；University of Liverpool（利物浦大学）；University of Brescia（布雷西亚大学）；University of Huddersfield（哈德斯菲尔德大学）

This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances. The approach is based on the idea of reducing the problem of computing complete extensions to a SAT problem and then using a depth-first search method to derive preferred extensions. The proposed approach has been tested using two distinct SAT solvers and compared with three state-of-the-art systems for preferred extension computation. It turns out that the proposed approach delivers significantly better …

2013-10-23cs.AI

A Matrix Approach for Weighted Argumentation Frameworks: a Preliminary Report

Università degli Studi di Perugia（佩鲁贾大学）；Gran Sasso Science Institute（格兰萨索科学研究所）

The assignment of weights to attacks in a classical Argumentation Framework allows to compute semantics by taking into account the different importance of each argument. We represent a Weighted Argumentation Framework by a non-binary matrix, and we characterize the basic extensions (such as w-admissible, w- stable, w-complete) by analysing sub-blocks of this matrix. Also, we show how to reduce the matrix into another one of smaller size, that is equivalent to the original one for the determination of extensions. Furthermore, we provide two algorithms that allow to build incrementally w-grounde…

2018-02-23cs.AI

Properties of Stable Model Semantics Extensions

Instituto Politécnico de Bragança（布拉干萨理工学院）；Universidade Nova de Lisboa（里斯本新大学）

The stable model (SM) semantics lacks the properties of existence, relevance and cumulativity. If we prospectively consider the class of conservative extensions of SM semantics (i.e., semantics that for each normal logic program P retrieve a superset of the set of stable models of P), one may wander how do the semantics of this class behave in what concerns the aforementioned properties. That is the type of issue dealt with in this paper. We define a large class of conservative extensions of the SM semantics, dubbed affix stable model semantics, ASM, and study the above referred properties int…

2014-05-15cs.AI

更多相关论文收起更多论文

有限论证框架中基于语义与优先语义的复杂性

Complexity of Grounded Semantics and Preferred Semantics in Finitary Argumentation Frameworks

School of Philosophy, Zhejiang University（浙江大学哲学学院）

本文研究可计算有限论证框架中基于语义与优先语义的标准判定问题复杂性，明确了有限性对推理复杂性的影响边界。

2026-10-09cs.AIcs.LO

On Concise Encodings of Preferred Extensions

Much work on argument systems has focussed on preferred extensions which define the maximal collectively defensible subsets. Identification and enumeration of these subsets is (under the usual assumptions) computationally demanding. We consider approaches to deciding if a subset S is a preferred extension which query a representations encoding all such extensions, so that the computational effort is invested once only (for the initial enumeration) rather than for each separate query.

2002-07-08cs.AIcs.CCcs.DS

Solving Set Optimization Problems by Cardinality Optimization via Weak Constraints with an Application to Argumentation

University of Huddersfield（哈德斯菲尔德大学）；Cardiff University（卡迪夫大学）；Università degli Studi di Brescia（布雷西亚大学）

Optimization - minimization or maximization - in the lattice of subsets is a frequent operation in Artificial Intelligence tasks. Examples are subset-minimal model-based diagnosis, nonmonotonic reasoning by means of circumscription, or preferred extensions in abstract argumentation. Finding the optimum among many admissible solutions is often harder than finding admissible solutions with respect to both computational complexity and methodology. This paper addresses the former issue by means of an effective method for finding subset-optimal solutions. It is based on the relationship between car…

2016-12-22cs.AI

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation

LAMSADE, CNRS, Paris, France（法国国家科学研究中心LAMSADE实验室）；Department of Theoretical Computer Science, Masaryk University, Brno, Czech Republic（马萨里克大学理论计算机科学系）；Institute of Information Systems, Vienna University of Technology, Vienna, Austria（维也纳工业大学信息系统研究所）

We study the computational complexity of problems that arise in abstract argumentation in the context of dynamic argumentation, minimal change, and aggregation. In particular, we consider the following problems where always an argumentation framework F and a small positive integer k are given. - The Repair problem asks whether a given set of arguments can be modified into an extension by at most k elementary changes (i.e., the extension is of distance k from the given set). - The Adjust problem asks whether a given extension can be modified by at most k elementary changes into an extension tha…

2014-02-25cs.AIcs.DS

Paracoherent Answer Set Semantics meets Argumentation Frameworks

University of Calabria（卡拉布里亚大学）

In the last years, abstract argumentation has met with great success in AI, since it has served to capture several non-monotonic logics for AI. Relations between argumentation framework (AF) semantics and logic programming ones are investigating more and more. In particular, great attention has been given to the well-known stable extensions of an AF, that are closely related to the answer sets of a logic program. However, if a framework admits a small incoherent part, no stable extension can be provided. To overcome this shortcoming, two semantics generalizing stable extensions have been studi…

2019-07-22cs.AIcs.LO

On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs

Autonomous University of Juarez（华雷斯自治大学）

Abstract Dialectical Frameworks (ADFs) are argumentation frameworks where each node is associated with an acceptance condition. This allows us to model different types of dependencies as supports and attacks. Previous studies provided a translation from Normal Logic Programs (NLPs) to ADFs and proved the stable models semantics for a normal logic program has an equivalent semantics to that of the corresponding ADF. However, these studies failed in identifying a semantics for ADFs equivalent to a three-valued semantics (as partial stable models and well-founded models) for NLPs. In this work, w…

2019-07-22cs.AIcs.LO

相对密度比优化用于稳定且统计一致的模型对齐

Relative Density Ratio Optimization for Stable and Statistically Consistent Model Alignment

NTT, Inc.（日本电信电话株式会社）；NTT DOCOMO, INC.（NTT DOCOMO公司）

本文提出一种稳定且统计一致的模型对齐方法，通过相对密度比优化，改进了直接密度比优化的稳定性与收敛性。

2026-09-29cs.AIcs.CLcs.LG

Dung's semantics satisfy attack removal monotonicity

CNRS（法国国家科学研究中心）；IRIT（法国信息与通信研究所）；CRIL（法国里尔计算机研究实验室）；Univ. Artois（阿图瓦大学）

We show that preferred, stable, complete, and grounded semantics satisfy attack removal monotonicity. This means that if an attack from b to a is removed, the status of a cannot worsen, e.g. if a was skeptically accepted, it cannot become rejected.

2020-07-08cs.AI

Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs: Theory and Empirical Results

Zhejiang University（浙江大学）；University of Luxembourg（卢森堡大学）

In existing literature, while approximate approaches based on Monte-Carlo simulation technique have been proposed to compute the semantics of probabilistic argumentation, how to improve the efficiency of computation without using simulation technique is still an open problem. In this paper, we address this problem from the following two perspectives. First, conceptually, we define specific properties to characterize the subgraphs of a PrAG with respect to a given extension, such that the probability of a set of arguments E being an extension can be defined in terms of these properties, without…

2016-11-28cs.AI