Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets

DOI10.1007/978-3-642-22152-1_4zbMath1341.68254OpenAlexW1592744966MaRDI QIDQ3011933

Stefan Woltran, Sarah A. Gaggl

Publication date: 29 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22152-1_4

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (4)

Normal and strong expansion equivalence for argumentation frameworks ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ Principles Of Talmudic Logic ⋮ Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets

Cites Work

• Characterizing strong equivalence for argumentation frameworks
• On the evaluation of argumentation formalisms
• Computing ideal sceptical argumentation
• On principle-based evaluation of extension-based argumentation semantics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• SCC-recursiveness: a general schema for argumentation semantics
• The cf2 argumentation semantics revisited
• Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets
• A General Framework for Argumentation-Based Negotiation
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty

This page was built for publication: Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets