Minimal Strong Admissibility: A Complexity Analysis



Caminada, Martin and Dunne, Paul E ORCID: 0000-0002-6033-3742
(2020) Minimal Strong Admissibility: A Complexity Analysis. .

[img] Text
COMMA_2020_paper_25.pdf - Accepted Version

Download (288kB) | Preview
Item Type: Conference or Workshop Item (Unspecified)
Uncontrolled Keywords: strong admissibility, computational complexity, explainable AI
Depositing User: Symplectic Admin
Date Deposited: 07 Jul 2020 08:55
Last Modified: 30 Jun 2021 18:18
DOI: 10.3233/FAIA200499
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3092253