{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T13:03:17Z","timestamp":1768741397213,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540878025","type":"print"},{"value":"9783540878032","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87803-2_14","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T10:35:16Z","timestamp":1222166116000},"page":"153-165","source":"Crossref","is-referenced-by-count":12,"title":["Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks"],"prefix":"10.1007","author":[{"given":"Paul E.","family":"Dunne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Caminada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","first-page":"357","volume-title":"Proceedings of the Eighth Dutch Conference on Artificial Intelligence (NAIC 1996)","author":"B. Verheij","year":"1996","unstructured":"Verheij, B.: Two approaches to dialectical argumentation: admissible sets and argumentation stages. In: Meyer, J.J., van der Gaag, L. (eds.) Proceedings of the Eighth Dutch Conference on Artificial Intelligence (NAIC 1996), pp. 357\u2013368. Utrecht University, Utrecht (1996)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/logcom\/13.3.319","volume":"13","author":"B. Verheij","year":"2003","unstructured":"Verheij, B.: Deflog: on the logical interpretation of prima facie justified assumptions. Journal of Logic and Computation\u00a013, 319\u2013346 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"14_CR3","series-title":"FAIA","first-page":"121","volume-title":"Proc. 1st Int. Conf. on Computational Models of Argument","author":"M. Caminada","year":"2006","unstructured":"Caminada, M.: Semi-stable semantics. In: Dunne, P.E., Bench-Capon, T.J.M. (eds.) Proc. 1st Int. Conf. on Computational Models of Argument. FAIA, vol.\u00a0144, pp. 121\u2013130. IOS Press, Amsterdam (2006)"},{"key":"14_CR4","unstructured":"Caminada, M., Ben-Naim, J.: Postulates for paraconsistent reasoning and fault tolerant logic programming. Technical Report Technical Report UU-CS-2007-004, Utrecht University (2007)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"P.M. Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reason, logic programming, and N-person games. Artificial Intelligence\u00a077, 321\u2013357 (1995)","journal-title":"Artificial Intelligence"},{"key":"14_CR6","first-page":"1070","volume-title":"Proceedings of the 5th International Conference\/Symposium on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 5th International Conference\/Symposium on Logic Programming, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"issue":"3\/4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing\u00a09(3\/4), 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0004-3702(98)00032-0","volume":"102","author":"O. Arieli","year":"1998","unstructured":"Arieli, O., Avron, A.: The value of four values. Artificial Intellligence\u00a0102, 97\u2013141 (1998)","journal-title":"Artificial Intellligence"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence\u00a013, 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.artint.2007.04.004","volume":"171","author":"P. Baroni","year":"2007","unstructured":"Baroni, P., Giacomin, M.: On principle-based evaluation of extension-based argumentation semantics. Artificial Intelligence\u00a0171, 675\u2013700 (2007); special issue on argumentation in artificial intelligence","journal-title":"Artificial Intelligence"},{"key":"14_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-75256-1_21","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"P. Baroni","year":"2007","unstructured":"Baroni, P., Giacomin, M.: Comparing argumentation semantics with respect to skepticism. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol.\u00a04724, pp. 210\u2013221. Springer, Heidelberg (2007)"},{"key":"14_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-75256-1_22","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"M. Caminada","year":"2007","unstructured":"Caminada, M.: An algorithm for computing semi-stable semantics. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol.\u00a04724, pp. 222\u2013234. Springer, Heidelberg (2007)"},{"key":"14_CR13","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":"14_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(02)00261-8","volume":"141","author":"P.E. Dunne","year":"2002","unstructured":"Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artificial Intelligence\u00a0141, 187\u2013203 (2002)","journal-title":"Artificial Intelligence"},{"key":"14_CR15","series-title":"FAIA","first-page":"147","volume-title":"Proc. 2nd Int. Conf. on Computational Models of Argument","author":"P.E. Dunne","year":"2008","unstructured":"Dunne, P.E.: The computational complexity of ideal semantics I: abstract argumentation frameworks. In: Proc. 2nd Int. Conf. on Computational Models of Argument. FAIA, vol.\u00a0172, pp. 147\u2013158. IOS Press, Amsterdam (2008)"},{"key":"14_CR16","series-title":"FAIA","first-page":"145","volume-title":"Proc. 1st Int. Conf. on Computational Models of Argument","author":"P.M. Dung","year":"2006","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: A dialectical procedure for sceptical assumption-based argumentation. In: Dunne, P.E., Bench-Capon, T.J.M. (eds.) Proc. 1st Int. Conf. on Computational Models of Argument. FAIA, vol.\u00a0144, pp. 145\u2013156. IOS Press, Amsterdam (2006)"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"P.M. Dung","year":"2007","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artificial Intelligence\u00a0171, 642\u2013674 (2007)","journal-title":"Artificial Intelligence"},{"key":"14_CR18","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Wagner, K.: Bounded query computations. In: Proc. 3rd Conf. on Structure in Complexity Theory, pp. 260\u2013277 (1988)","DOI":"10.1109\/SCT.1988.5286"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0219058","volume":"19","author":"K. Wagner","year":"1990","unstructured":"Wagner, K.: Bounded query classes. SIAM Jnl. Comput.\u00a019, 833\u2013846 (1990)","journal-title":"SIAM Jnl. Comput."},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(94)00080-3","volume":"141","author":"B. Jenner","year":"1995","unstructured":"Jenner, B., Toran, J.: Computing functions with parallel queries to NP. Theoretical Computer Science\u00a0141, 175\u2013193 (1995)","journal-title":"Theoretical Computer Science"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","volume":"47","author":"L.G. Valiant","year":"1986","unstructured":"Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theoretical Computer Science\u00a047, 85\u201393 (1986)","journal-title":"Theoretical Computer Science"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01303054","volume":"28","author":"R. Chang","year":"1995","unstructured":"Chang, R., Kadin, J.: On computing Boolean connectives of characteristic functions. Math. Syst. Theory\u00a028, 173\u2013198 (1995)","journal-title":"Math. Syst. Theory"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.artint.2007.03.006","volume":"171","author":"P.E. Dunne","year":"2007","unstructured":"Dunne, P.E.: Computational properties of argument systems satisfying graph-theoretic constraints. Artificial Intelligence\u00a0171, 701\u2013729 (2007)","journal-title":"Artificial Intelligence"},{"key":"14_CR25","unstructured":"Verheij, B.: A labelling approach to the computation of credulous acceptance in argumentation. In: Proc. IJCAI 2007, pp. 623\u2013628 (2007)"},{"key":"14_CR26","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, argumentation-theoretic approach to default reasoning. Artificial Intelligence\u00a093, 63\u2013101 (1997)","journal-title":"Artificial Intelligence"},{"key":"14_CR27","first-page":"36","volume-title":"Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999","author":"Y. Dimopoulos","year":"1999","unstructured":"Dimopoulos, Y., Nebel, B., Toni, F.: Preferred arguments are harder to compute than stable extensions. In: Thomas, D. (ed.) Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999, pp. 36\u201343. Morgan Kaufmann, San Francisco (1999)"},{"key":"14_CR28","first-page":"53","volume-title":"KR2000: Principles of Knowledge Representation and Reasoning","author":"Y. Dimopoulos","year":"2000","unstructured":"Dimopoulos, Y., Nebel, B., Toni, F.: Finding admissible and preferred arguments can be very hard. In: Cohn, A.G., Giunchiglia, F., Selman, B. (eds.) KR2000: Principles of Knowledge Representation and Reasoning, pp. 53\u201361. Morgan Kaufmann, San Francisco (2000)"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"55","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, 55\u201378 (2002)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87803-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:49:53Z","timestamp":1619524193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87803-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540878025","9783540878032"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87803-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}