{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:25:48Z","timestamp":1740115548216,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:p>In this paper we describe the system ArgSemSAT which includes algorithms which we proved to overcome current state-of-the-art performances in enumerating preferred extensions.<\/jats:p>","DOI":"10.3233\/978-1-61499-436-7-455","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T12:06:08Z","timestamp":1740053168000},"source":"Crossref","is-referenced-by-count":0,"title":["ArgSemSAT: Solving Argumentation Problems Using SAT"],"prefix":"10.3233","author":[{"family":"Cerutti Federico","sequence":"additional","affiliation":[]},{"family":"Giacomin Massimiliano","sequence":"additional","affiliation":[]},{"family":"Vallati Mauro","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Computational Models of Argument"],"original-title":[],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T13:01:27Z","timestamp":1740056487000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=266&spage=455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-436-7-455","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]}}}