On rejected arguments and implicit conflicts: the hidden power of argumentation semantics

DOI10.1016/J.ARTINT.2016.09.004MaRDI QIDQ334820zbMATH OpenOpenAlexFDO

Authors Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, Christof Spanring, Hannes Strass, Stefan Woltran

Publication date 1 November 2016

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2016.09.004

zbMATH Keywords

complexitynonmonotonic reasoningabstract argumentation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 6747868
• The hidden power of abstract argumentation semantics
• Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks
• Logical limits of abstract argumentation frameworks
• Conflict-tolerant semantics for argumentation frameworks

Cites work

• scientific article; zbMATH DE number 6747868 (Why is no real title available?)
• A translation-based approach for revision of argumentation frameworks
• An extension-based approach to belief revision in abstract argumentation
• Answer-set programming encodings for argumentation frameworks
• Argumentation in artificial intelligence
• Characteristics of multiple viewpoints in abstract argumentation
• Coherence in finite argument systems.
• Comparing Argumentation Semantics with Respect to Skepticism
• Comparing the expressiveness of argumentation semantics
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Complexity-sensitive decision procedures for abstract argumentation
• Computational properties of argument systems satisfying graph-theoretic constraints
• Graph theoretical structures in logic programs and default theories
• Graphs with the second largest number of maximal independent sets
• Infinite argumentation frameworks. On the existence and uniqueness of extensions
• On cliques in graphs
• 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
• On the evaluation of argumentation formalisms
• On the maximal and average numbers of stable extensions
• On the resolution-based family of abstract argumentation semantics and its grounded instance
• Open problems in abstract argumentation
• Semi-stable semantics
• Splitting an Argumentation Framework
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• The computational complexity of ideal semantics
• The first international competition on computational models of argumentation: results and analysis
• The hidden power of abstract argumentation semantics
• The number of maximal independent sets in a connected graph

Cited in

(7)

• Static and dynamic orderings on Dungean argumentation frameworks -- an overview
• A general notion of equivalence for abstract argumentation
• The \(cf2\) argumentation semantics revisited
• Realizability of three-valued semantics for abstract dialectical frameworks
• The hidden power of abstract argumentation semantics
• An extension-based approach to belief revision in abstract argumentation
• A general approach to extension-based semantics in abstract argumentation

This page was built for publication: On rejected arguments and implicit conflicts: the hidden power of argumentation semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334820)