{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:26:52Z","timestamp":1740202012982,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.3233\/faia200499","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:27:24Z","timestamp":1740133644000},"source":"Crossref","is-referenced-by-count":0,"title":["Minimal Strong Admissibility: A Complexity Analysis"],"prefix":"10.3233","author":[{"family":"Caminada Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Dunne Paul E.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Computational Models of Argument"],"original-title":[],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:55:42Z","timestamp":1740135342000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISBN&isbn=978-1-64368-106-1&spage=135&doi=10.3233\/FAIA200499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia200499","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2020]]}}}