{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:23:05Z","timestamp":1760170985059},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2016,5,3]],"date-time":"2016-05-03T00:00:00Z","timestamp":1462233600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Characterizations of semi-stable and stage extensions in terms of two-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming counterparts of the notion of range which is an established concept in argumentation semantics.<\/jats:p>","DOI":"10.1017\/s1471068416000090","type":"journal-article","created":{"date-parts":[[2016,5,3]],"date-time":"2016-05-03T07:55:13Z","timestamp":1462262113000},"page":"75-90","source":"Crossref","is-referenced-by-count":3,"title":["Range-based argumentation semantics as two-valued models"],"prefix":"10.1017","volume":"17","author":[{"given":"MAURICIO","family":"OSORIO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JUAN CARLOS","family":"NIEVES","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2016,5,3]]},"reference":[{"key":"S1471068416000090_ref18","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1093\/logcom\/exl013","article-title":"Logics with common weak completions","volume":"16","author":"Osorio","year":"2006","journal-title":"Journal of Logic and Computation"},{"key":"S1471068416000090_ref23","unstructured":"Verheij B. 1996. Two approaches to dialectical argumentation: admissible sets and argumentation stages. In Proc. of the 8th Dutch Conference on Artificial Intelligence (NAIC 1996), 357\u2013368."},{"key":"S1471068416000090_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.008"},{"key":"S1471068416000090_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20832-4_11"},{"key":"S1471068416000090_ref20","first-page":"219","volume-title":"Handbook of Philosophical Logic","author":"Prakken","year":"2002"},{"key":"S1471068416000090_ref14","article-title":"Ideal extensions as logical programming models","author":"Nieves","year":"2014","journal-title":"Journal of Logic and Computation"},{"key":"S1471068416000090_ref10","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2010.486479"},{"key":"S1471068416000090_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(07)03007-6"},{"key":"S1471068416000090_ref15","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003359"},{"key":"S1471068416000090_ref5","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exr033"},{"key":"S1471068416000090_ref13","first-page":"1070","volume-title":"Proc. 5th Conference on Logic Programming","author":"Gelfond","year":"1988"},{"key":"S1471068416000090_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068416000090_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.04.005"},{"key":"S1471068416000090_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9216-z"},{"key":"S1471068416000090_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.09.004"},{"key":"S1471068416000090_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9210-5"},{"key":"S1471068416000090_ref17","first-page":"198","volume-title":"Proc. 6th Mexican International Conference on Computer Science (ENC 2005)","author":"Nieves","year":"2005"},{"key":"S1471068416000090_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888911000166"},{"key":"S1471068416000090_ref19","first-page":"81","volume-title":"Mexican International Conference on Computer Science","author":"Osorio","year":"2013"},{"key":"S1471068416000090_ref3","first-page":"121","volume-title":"Proc. of COMMA","author":"Caminada","year":"2006"},{"key":"S1471068416000090_ref4","doi-asserted-by":"crossref","unstructured":"Caminada M. , S\u00e1 S. and Alc\u00e2ntara J. 2013. On the Equivalence between Logic Programming Semantics and Argumentation Semantics. Technical Report ABDN-CS-13-01, University of Aberdeen.","DOI":"10.1007\/978-3-642-39091-3_9"},{"key":"S1471068416000090_ref16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.3233\/FI-2011-388","article-title":"A schema for generating relevant logic programming semantics and its applications in argumentation theory","volume":"106","author":"Nieves","year":"2011","journal-title":"Fundamenta Informaticae"},{"key":"S1471068416000090_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S1471068416000090_ref6","first-page":"38","article-title":"Inferring preferred extensions by pstable semantics","volume":"13","author":"Carballido","year":"2009","journal-title":"Iberoamerican Journal of Artificial Intelligence (Inteligencia Artificial) ISSN: 1137-3601, (doi: 10.4114\/ia.v13i41.1029)"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068416000090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T10:31:00Z","timestamp":1600511460000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068416000090\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,3]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["S1471068416000090"],"URL":"https:\/\/doi.org\/10.1017\/s1471068416000090","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,3]]}}}