{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:13:32Z","timestamp":1776330812823,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3978,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0004-3702(02)00261-8","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T12:14:51Z","timestamp":1034079291000},"page":"187-203","source":"Crossref","is-referenced-by-count":121,"title":["Coherence in finite argument systems"],"prefix":"10.1016","volume":"141","author":[{"given":"Paul E.","family":"Dunne","sequence":"first","affiliation":[]},{"given":"T.J.M.","family":"Bench-Capon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00261-8_BIB001","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(95)00095-X","article-title":"Default reasoning using classical logic","volume":"84","author":"Ben-Eliyahu","year":"1996","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00261-8_BIB002","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0004-3702(97)00015-5","article-title":"An abstract, argumentation-theoretic approach to default reasoning","volume":"93","author":"Bondarenko","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB003","series-title":"Proc. Sixth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-2001)","first-page":"668","article-title":"Dialectical proof theories for the credulous preferred semantics of argumentation frameworks","volume":"2143","author":"Cayrol","year":"2001"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB004","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(90)90327-E","article-title":"Kernels in random graphs","volume":"82","author":"Fernandez de la Vega","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0004-3702(02)00261-8_BIB005","series-title":"Proc. IJCAI-99, Stockholm, Sweden, Vol. 1","first-page":"36","article-title":"Preferred arguments are harder to compute than stable extensions","author":"Dimopoulos","year":"1999"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB006","series-title":"Principles of Knowledge Representation and Reasoning (KR-2000)","first-page":"53","article-title":"Finding admissible and preferred arguments can be very hard","author":"Dimopoulos","year":"2000"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB007","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","article-title":"Graph theoretical structures in logic programs and default theories","volume":"170","author":"Dimopoulos","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(02)00261-8_BIB008","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and N-person games","volume":"77","author":"Dung","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB009","series-title":"The Complexity of Boolean Networks","author":"Dunne","year":"1988"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB010","unstructured":"P.E. Dunne, T.J.M. Bench-Capon, Two party immediate response disputes: Properties and efficiency, Technical Report, Department of Computer Science, Univ. of Liverpool, http:\/\/www.csc.liv.ac.uk\/~ped\/papers\/tpi.ps, October 2001, submitted"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB011","series-title":"Proc. Seventh International Conference on Artificial Intelligence and Law (ICAIL-99), ACM SIGART","first-page":"53","article-title":"Dialectic semantics for argumentation frameworks","author":"Jakobovits","year":"1999"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB012","series-title":"Logical Tools for Modelling Legal Argument","author":"Prakken","year":"1997"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB013","series-title":"Proc. JELIA'2000, The 7th European Workshop on Logic for Artificial Intelligence","first-page":"224","article-title":"Credulous and sceptical argument games for preferred semantics","volume":"1919","author":"Vreeswijk","year":"2000"},{"key":"10.1016\/S0004-3702(02)00261-8_BIB014","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1976","journal-title":"Theoret. Comput. Sci."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002618?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002618?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T13:01:27Z","timestamp":1554814887000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202002618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0004370202002618"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00261-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}