Characterizing strong equivalence for argumentation frameworks
type: Item
instance of: scholarly article
title: Characterizing strong equivalence for argumentation frameworks
zbMATH Open document ID: 1252.68279
author: Emilia Oikarinen
author: Stefan Woltran
published in: Artificial Intelligence
publication date: 2012-05-23T00:00:00Z
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 6037779
zbMATH Keywords: abstract argumentation
zbMATH Keywords: semantics
zbMATH Keywords: equivalence
Wikidata QID: Q56551823
MaRDI profile type: Publication
full work available at URL: j.artint.2011.06.003
OpenAlex ID: W2129730018
cites work: On the resolution-based family of abstract argumentation semantics and its grounded instance
cites work: On principle-based evaluation of extension-based argumentation semantics
cites work: SCC-recursiveness: a general schema for argumentation semantics
cites work: Q3160990
cites work: Argumentation in artificial intelligence
cites work: Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
cites work: On the Issue of Reinstatement in Argumentation
cites work: An Algorithm for Computing Semi-stable Semantics
cites work: Change in Abstract Argumentation Frameworks: Adding an Argument
cites work: On the merging of Dung's argumentation systems
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Computing ideal sceptical argumentation
cites work: The computational complexity of ideal semantics
cites work: Semantical characterizations and complexity of equivalences in answer set programming
cites work: Explanations, belief revision and defeasible reasoning.
cites work: Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets
cites work: Instantiating abstract argumentation with classical logic arguments: postulates and properties
cites work: Strongly equivalent logic programs
cites work: On graph equivalences preserved under extensions
cites work: Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
cites work: Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
cites work: Logic Programming and Nonmonotonic Reasoning
cites work: A common view on strong, uniform, and other notions of equivalence in answer-set programming
DBLP publication ID: journals/ai/OikarinenW11
DOI: 10.1016/J.ARTINT.2011.06.003
description: scientific article; zbMATH DE number 6037779