Open problems in abstract argumentation

DOI10.1007/978-3-319-14726-0_22MaRDI QIDQ5172624zbMATH OpenOpenAlexFDO

Authors Ringo Baumann, Hannes Strass

Publication date 4 February 2015

Published in Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-14726-0_22

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
• On computing the set of acceptable arguments in abstract argumentation
• Methods for solving reasoning problems in abstract argumentation -- a survey
• I don't care, I don't know \(\dots \) I know too much! on incompleteness and undecidedness in abstract argumentation
• Abstract argumentation systems

Cites work

• Argumentation in artificial intelligence
• Change in abstract argumentation frameworks: adding an argument
• Characteristics of multiple viewpoints in abstract argumentation
• Characterizing strong equivalence for argumentation frameworks
• Computing ideal sceptical argumentation
• Context-free and context-sensitive kernels: update and deletion equivalence in abstract argumentation
• Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
• Dynamics of argumentation systems: a division-based method
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 6747868 (Why is no real title available?)
• Logic Programming and Nonmonotonic Reasoning
• Metalogical contributions to the nonmonotonic theory of abstract argumentation
• Normal and strong expansion equivalence for argumentation frameworks
• 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 maximal and average numbers of stable extensions
• On the resolution-based family of abstract argumentation semantics and its grounded instance
• Parametric properties of ideal semantics
• SCC-recursiveness: a general schema for argumentation semantics
• Spectra in Abstract Argumentation: An Analysis of Minimal Change
• Splitting an Argumentation Framework
• Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
• Strongly equivalent logic programs
• The computational complexity of ideal semantics
• The role of self-attacking arguments in characterizations of equivalence notions
• What does it take to enforce an argument? Minimal change in abstract argumentation

Cited in

(6)

• Methods for solving reasoning problems in abstract argumentation -- a survey
• How can you resolve a trilemma? A topological approach
• On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
• Abstract Machines for Argumentation
• Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
• Enumeration of preferred extensions in almost oriented digraphs

This page was built for publication: Open problems in abstract argumentation

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