{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:19:11Z","timestamp":1760170751451,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239625"},{"type":"electronic","value":"9783642239632"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23963-2_10","type":"book-chapter","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T01:29:02Z","timestamp":1317864542000},"page":"110-122","source":"Crossref","is-referenced-by-count":9,"title":["Argumentation Frameworks as Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Leila","family":"Amgoud","sequence":"first","affiliation":[]},{"given":"Caroline","family":"Devred","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Argumentation in Artificial Intelligence","year":"2009","key":"10_CR1","unstructured":"Rahwan, I., Simari, G. (eds.): Argumentation in Artificial Intelligence. Springer, Heidelberg (2009)"},{"key":"10_CR2","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\u2013216 (2002)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1093\/logcom\/13.3.429","volume":"13","author":"T.J.M. Bench-Capon","year":"2003","unstructured":"Bench-Capon, T.J.M.: Persuasion in practical argument using value-based argumentation frameworks. Journal of Logic and Computation\u00a013(3), 429\u2013448 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"10_CR4","unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: NMR, pp. 59\u201364 (2004)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Santini, F.: A common computational framework for semiring-based argumentation systems. In: ECAI, pp. 131\u2013136 (2010)","DOI":"10.3233\/978-1-60750-606-5-131"},{"key":"10_CR6","unstructured":"Caminada, M.: Semi-stable semantics. In: Proceedings of the 1st International Conference on Computational Models of Argument (COMMA 2006), pp. 121\u2013130 (2006)"},{"key":"10_CR7","unstructured":"Castell, T., Fargier, H.: Propositional satisfaction problems and clausal csps. In: ECAI, pp. 214\u2013218 (1998)"},{"issue":"3","key":"10_CR8","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(3), 377\u2013403 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"10_CR9","unstructured":"Coste-Marquis, S., Devred, C., Marquis, P.: Constrained argumentation frameworks. In: KR, pp. 112\u2013122 (2006)"},{"issue":"1&2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(94)00182-I","volume":"145","author":"N. Creignou","year":"1995","unstructured":"Creignou, N.: The class of problems that are linearly equivalent to satisfiability or a uniform method for proving np-completeness. Theor. Comput. Sci.\u00a0145(1&2), 111\u2013145 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR11","unstructured":"Devred, C., Doutre, S., Lef\u00e8vre, C., Nicolas, P.: Dialectical proofs for constrained argumentation. In: COMMA, pp. 159\u2013170 (2010)"},{"key":"10_CR12","unstructured":"Dimopoulos, Y., Nebel, B., Toni, F.: Preferred arguments are harder to compute than stable extensions. In: IJCAI 1999, pp. 36\u201343 (1999)"},{"key":"10_CR13","unstructured":"Dimopoulos, Y., Nebel, B., Toni, F.: Finding admissible and preferred arguments can be very hard. In: KR 2000, pp. 53\u201361 (2000)"},{"key":"10_CR14","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 skeptical argumentation. Artificial Intelligence Journal\u00a0171, 642\u2013674 (2007)","journal-title":"Artificial Intelligence Journal"},{"key":"10_CR15","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 reasoning, logic programming and n-person games. Artificial Intelligence Journal\u00a077, 321\u2013357 (1995)","journal-title":"Artificial Intelligence Journal"},{"key":"10_CR16","unstructured":"Dunne, P., Hunter, A., McBurney, P., Parsons, S., Wooldridge, M.: Inconsistency tolerance in weighted argument systems. In: AAMAS, pp. 851\u2013858 (2009)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Dunne, P., Wooldridge, M.: Complexity of abstract argumentation. In: Rahwan, I., Simari, G. (eds.) Argumentation in Artificial Intelligence. ch.4, pp. 85\u2013104 (2009)","DOI":"10.1007\/978-0-387-98197-0_5"},{"key":"10_CR18","unstructured":"Egly, U., Gaggl, S., Woltran, S.: Answer-set programming encodings for argumentation frameworks. In: Technical report DBAI-TR-2008-62, Technische Universitat Wien (2008)"},{"key":"10_CR19","first-page":"1004","volume":"2","author":"V. Kumar","year":"1987","unstructured":"Kumar, V.: Depth-first search. Encyclopaedia of Artificial Intelligence\u00a02, 1004\u20131005 (1987)","journal-title":"Encyclopaedia of Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Scalable Uncertainty Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23963-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T14:11:24Z","timestamp":1741788684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23963-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239625","9783642239632"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23963-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}