{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:08:03Z","timestamp":1767650883255},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232421"},{"type":"electronic","value":"9783540302278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30227-8_39","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:34:52Z","timestamp":1284860092000},"page":"462-473","source":"Crossref","is-referenced-by-count":13,"title":["On Sceptical Versus Credulous Acceptance for Abstract Argument Systems"],"prefix":"10.1007","author":[{"given":"Sylvie","family":"Doutre","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Mengin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0004-3702(97)00015-5","volume":"93","author":"A. Bondarenko","year":"1997","unstructured":"Bondarenko, A., Dung, P., Kowalski, R., Toni, F.: An abstract, argumentationtheoretic approach to default reasoning. Artificial Intelligence\u00a093, 63\u2013101 (1997)","journal-title":"Artificial Intelligence"},{"key":"39_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","volume":"170","author":"Y. Dimopoulos","year":"1996","unstructured":"Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theoretical Computer Science\u00a0170, 209\u2013244 (1996)","journal-title":"Theoretical Computer Science"},{"key":"39_CR3","unstructured":"Dimopoulos, Y., Magirou, V., Papadimitriou, C.: On kernels, Defaults and Even Graphs. Annals of Mathematics and AI, 1\u201312 (1997)"},{"key":"39_CR4","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"P. Dung","year":"1995","unstructured":"Dung, P.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence\u00a077, 321\u2013357 (1995)","journal-title":"Artificial Intelligence"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/logcom\/9.4.515","volume":"9","author":"A. Kakas","year":"1999","unstructured":"Kakas, A., Toni, F.: Computing Argumentation in Logic Programming. Journal of Logic and Computation\u00a09, 515\u2013562 (1999)","journal-title":"Journal of Logic and Computation"},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/11663081.1997.10510900","volume":"7","author":"H. Prakken","year":"1997","unstructured":"Prakken, H., Sartor, G.: Argument-based logic programming with defeasible priorities. Journal of Applied Non-Classical Logics\u00a07, 25\u201375 (1997)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1014490210693","volume":"34","author":"L. Amgoud","year":"2002","unstructured":"Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Annals of Mathematics and Artificial Intelligence\u00a034, 197\u2013215 (2002)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"39_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-40006-0_17","volume-title":"Logics in Artificial Intelligence","author":"G. Vreeswijk","year":"2000","unstructured":"Vreeswijk, G., Prakken, H.: Credulous and Sceptical Argument Games for Preferred Semantics. In: Brewka, G., Moniz Pereira, L., Ojeda-Aciego, M., de Guzm\u00e1n, I.P. (eds.) JELIA 2000. LNCS (LNAI), vol.\u00a01919, pp. 239\u2013253. Springer, Heidelberg (2000)"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1093\/logcom\/13.3.377","volume":"13","author":"C. Cayrol","year":"2003","unstructured":"Cayrol, C., Doutre, S., Mengin, J.: On Decision Problems related to the preferred semantics for argumentation frameworks. Journal of Logic and Computation\u00a013, 377\u2013403 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Doutre, S., Mengin, J.: On sceptical vs credulous acceptance for abstract argument systems. In: Tenth International Workshop on Non-Monotonic Reasoning (NMR 2004), pp. 134\u2013139 (2004)","DOI":"10.1007\/978-3-540-30227-8_39"},{"key":"39_CR12","unstructured":"Doutre, S.: Autour de la s\u00e9mantique pr\u00e9f\u00e9r\u00e9e des syst\u00e8mes d\u2019argumentation. PhD Thesis, Universit\u00e9 Paul Sabatier, Toulouse (2002)"},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/323706.323715","volume-title":"Proc. ICAIL 1999","author":"H. Jakobovits","year":"1999","unstructured":"Jakobovits, H., Vermeir, D.: Dialectic Semantics for Argumentation Frameworks. In: Proc. ICAIL 1999, pp. 53\u201362. ACM Press, New York (1999)"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(02)00245-X","volume":"141","author":"Y. Dimopoulos","year":"2002","unstructured":"Dimopoulos, Y., Nebel, B., Toni, F.: On the Computational Complexity of Assumption-based Argumentation for Default Reasoning. Artificial Intelligence\u00a0141, 57\u201378 (2002)","journal-title":"Artificial Intelligence"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(02)00261-8","volume":"141","author":"P. Dunne","year":"2002","unstructured":"Dunne, P., Bench-Capon, T.: Coherence in Finite Argument Systems. Artificial Intelligence\u00a0141, 187\u2013203 (2002)","journal-title":"Artificial Intelligence"},{"key":"39_CR16","first-page":"463","volume-title":"Proceedings of the 11th International Joint Conference on Artificial Intelligence","author":"A.B. Baker","year":"1989","unstructured":"Baker, A.B., Ginsberg, M.L.: A theorem prover for prioritized circumscription. In: Proceedings of the 11th International Joint Conference on Artificial Intelligence, pp. 463\u2013467. Morgan Kaufmann, San Francisco (1989)"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1111\/j.1467-8640.1989.tb00319.x","volume":"5","author":"D.L. Poole","year":"1989","unstructured":"Poole, D.L.: Explanation and prediction: an architecture for default and abductive reasoning. Computational Intelligence\u00a05, 97\u2013110 (1989)","journal-title":"Computational Intelligence"},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","volume":"38","author":"T. Przymusinski","year":"1989","unstructured":"Przymusinski, T.: An algorithm to compute circumscription. Artificial Intelligence\u00a038, 49\u201373 (1989)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30227-8_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:50:56Z","timestamp":1605761456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30227-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232421","9783540302278"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30227-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}