Minimal strong admissibility: a complexity analysis

DOI10.3233/FAIA200499MaRDI QIDQ5145805zbMATH OpenFDO

Authors Martin Caminada, Paul E. Dunne

Publication date 21 January 2021

zbMATH Keywords

computational complexitystrong admissibilityexplainable AI

Mathematics Subject Classification ID

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

Recommendations

• Computing strongly admissible sets
• scientific article; zbMATH DE number 7238899
• Dialectic proof procedures for assumption-based, admissible argumentation
• The computational complexity of ideal semantics
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks

Cited in

(5)

• Minimality, necessity and sufficiency for argumentation and explanation
• On dp-minimality, strong dependence and weight
• On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing
• Computing strongly admissible sets
• Hardness and inapproximability of minimizing adaptive distinguishing sequences

This page was built for publication: Minimal strong admissibility: a complexity analysis

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