Computing strongly admissible sets

DOI10.3233/FAIA200503MaRDI QIDQ5145810zbMATH OpenOpenAlexFDO

Authors Wolfgang Dvořák, Johannes Wallner

Publication date 21 January 2021

Full work available at URL https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200503

zbMATH Keywords

abstract argumentationanswer set programmingcomputational complexityinteger linear programmingstrongly admissible

Mathematics Subject Classification ID

Logic programming (68N17) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Integer programming (90C10)

Recommendations

• Minimal strong admissibility: a complexity analysis
• On computing the set of acceptable arguments in abstract argumentation
• Indepth combinatorial analysis of admissible sets for abstract argumentation
• On checking skeptical and ideal admissibility in abstract argumentation frameworks
• The computational complexity of ideal semantics

Cited in

(5)

• Indepth combinatorial analysis of admissible sets for abstract argumentation
• Solving set optimization problems by cardinality optimization with an application to argumentation
• Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility
• Minimal strong admissibility: a complexity analysis
• On computing the set of acceptable arguments in abstract argumentation

This page was built for publication: Computing strongly admissible sets

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