Minimal strong admissibility: a complexity analysis

DOI10.3233/FAIA200499zbMATH Open1464.68347MaRDI QIDQ5145805FDOQ5145805

Authors: Martin Caminada, Paul E. Dunne 

Publication date: 21 January 2021

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

zbMATH Keywords

computational complexitystrong admissibilityexplainable AI

Mathematics Subject Classification ID

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

Cited In (5)

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

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)