{"version.version":"0.0.7","version.cm_url":"https://github.com/ceurws/ceur-spt","spt.html_url":"/Vol-3835/paper1.html","spt.description":null,"spt.id":"Vol-3835/paper1","spt.wikidataid":null,"spt.title":"On Computational Problems for Infinite Argumentation Frameworks: The Complexity of Finding Acceptable Extensions","spt.pdfUrl":"https://ceur-ws.org/Vol-3835/paper1.pdf","spt.volume":{"number":3835,"acronym":"NMR 2024","wikidataid":"Q131388628","title":"Proceedings of the 22nd International Workshop on Nonmonotonic Reasoning (NMR 2024)","description":"Proceedings of NMR 2024 workshop","url":"http://ceur-ws.org/Vol-3835/","date":"2024-11-19","dblp":null,"k10plus":null,"urn":"urn:nbn:de:0074-3835-0"},"spt.session":null,"cvb.id":"Vol-3835/paper1","cvb.title":"On Computational Problems for Infinite Argumentation Frameworks: The Complexity of Finding Acceptable Extensions","cvb.type":null,"cvb.position":null,"cvb.pagesFrom":null,"cvb.pagesTo":null,"cvb.authors":"Uri Andrews,Luca San Mauro","cvb.vol_number":"3835","cvb.pdf_name":"paper1.pdf","cvb.pages":"3-13","cvb.fail":null,"dblp.dblp_publication_id":"https://dblp.org/rec/conf/nmr/AndrewsM24","dblp.dblp_proceeding_id":"https://dblp.org/rec/conf/nmr/2024","dblp.volume_number":3835,"dblp.title":"On Computational Problems for Infinite Argumentation Frameworks: The Complexity of Finding Acceptable Extensions.","dblp.authors":[{"dblp_author_id":"https://dblp.org/pid/84/9206","label":"Uri Andrews","wikidata_id":null,"orcid_id":null,"gnd_id":null},{"dblp_author_id":"https://dblp.org/pid/161/4452","label":"Luca San Mauro","wikidata_id":"Q101121335","orcid_id":"0000-0002-3156-6870","gnd_id":"1236312228"}],"dblp.pdf_id":"Vol-3835/paper1"}