On the maximal and average numbers of stable extensions

DOI10.1007/978-3-642-54373-9_8zbMATH Open1405.68339OpenAlexW2227021214MaRDI QIDQ5405015FDOQ5405015

Ringo Baumann, Hannes Strass

Publication date: 31 March 2014

Published in: Theory and Applications of Formal Argumentation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54373-9_8

Recommendations

• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• A comparative test on the enumeration of extensions in abstract argumentation
• Stochastic local search algorithms for abstract argumentation under stable semantics
• On the complexity of probabilistic abstract argumentation frameworks
• Logical limits of abstract argumentation frameworks

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)

Cited In (6)

• Open Problems in Abstract Argumentation
• On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
• On dynamics in structured argumentation formalisms
• Characteristics of multiple viewpoints in abstract argumentation
• On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
• On the expressive power of assumption-based argumentation

This page was built for publication: On the maximal and average numbers of stable extensions

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