{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:40:03Z","timestamp":1745977203022,"version":"3.40.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T00:00:00Z","timestamp":1363910400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s10472-013-9343-0","type":"journal-article","created":{"date-parts":[[2013,3,21]],"date-time":"2013-03-21T09:22:15Z","timestamp":1363857735000},"page":"131-148","source":"Crossref","is-referenced-by-count":5,"title":["Argumentation frameworks as constraint satisfaction problems"],"prefix":"10.1007","volume":"69","author":[{"given":"Leila","family":"Amgoud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caroline","family":"Devred","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,22]]},"reference":[{"key":"9343_CR1","doi-asserted-by":"crossref","unstructured":"Rahwan, I., Simari, G. (eds.): Argumentation in Artificial Intelligence. Springer (2009)","DOI":"10.1007\/978-0-387-98197-0"},{"key":"9343_CR2","doi-asserted-by":"crossref","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. Ann. Math. Artif. Intell. 34, 197\u2013216 (2002)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"9","key":"9343_CR3","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1016\/j.ijar.2011.07.005","volume":"52","author":"L Amgoud","year":"2011","unstructured":"Amgoud, L., Devred, C., Lagasquie, M.: Generating possible intentions with constrained argumentation systems. Int. J. Approx. Reason. 52(9), 1363\u20131391 (2011)","journal-title":"Int. J. Approx. Reason."},{"issue":"3","key":"9343_CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1093\/logcom\/13.3.429","volume":"13","author":"TJM Bench-Capon","year":"2003","unstructured":"Bench-Capon, T.J.M.: Persuasion in practical argument using value-based argumentation frameworks. J. Log. Comput. 13(3), 429\u2013448 (2003)","journal-title":"J. Log. Comput."},{"key":"9343_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/B:CONS.0000024048.03454.c0","volume":"9","author":"H Bennaceur","year":"2004","unstructured":"Bennaceur, H.: A comparison between sat and csp techniques. Constraints 9, 123\u2013138 (2004)","journal-title":"Constraints"},{"key":"9343_CR6","doi-asserted-by":"crossref","unstructured":"Bentahar, J., Maamar, Z.: Complexity results for argumentation-based agent communication. In: IEEE International Conference on Innovations in Information Technology, pp.\u00a0506\u2013510 200 (2007)","DOI":"10.1109\/IIT.2007.4430428"},{"key":"9343_CR7","unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: NMR, pp.\u00a059\u201364 (2004)"},{"key":"9343_CR8","doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Santini, F.: A common computational framework for semiring-based argumentation systems. In: ECAI, pp.\u00a0131\u2013136 (2010)","DOI":"10.3233\/978-1-60750-606-5-131"},{"issue":"4","key":"9343_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1177352.1177354","volume":"38","author":"L Bordeaux","year":"2006","unstructured":"Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: A comparative survey. ACM Comput. Surv. 38(4), 1\u201354 (2006)","journal-title":"ACM Comput. Surv."},{"key":"9343_CR10","unstructured":"Caminada, M.: Semi-stable semantics. In: Proceedings of the 1st International Conference on Computational Models of Argument (COMMA\u201906), pp.\u00a0121\u2013130 (2006)"},{"key":"9343_CR11","unstructured":"Castell, T., Fargier, H.: Propositional satisfaction problems and clausal csps. In: ECAI, pp.\u00a0214\u2013218 (1998)"},{"issue":"3","key":"9343_CR12","doi-asserted-by":"crossref","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. J. Log. Comput. 13(3), 377\u2013403 (2003)","journal-title":"J. Log. Comput."},{"issue":"1","key":"9343_CR13","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(89)90080-5","volume":"41","author":"M Cooper","year":"1989","unstructured":"Cooper, M.: An optimal k-consistency algorithm. Artif. Intell. 41(1), 89\u201395 (1989)","journal-title":"Artif. Intell."},{"key":"9343_CR14","unstructured":"Coste-Marquis, S., Devred, C., Marquis, P.: Constrained argumentation frameworks. In: KR, pp.\u00a0112\u2013122 (2006)"},{"issue":"1\u00a0&\u00a02","key":"9343_CR15","doi-asserted-by":"crossref","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. 145(1\u00a0&\u00a02):111\u2013145 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"9343_CR16","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. In: KR, pp.\u00a083\u201393 (1989)"},{"key":"9343_CR17","unstructured":"Devred, C., Doutre, S., Lef\u00e8vre, C., Nicolas, P.: Dialectical proofs for constrained argumentation. In: COMMA, pp.\u00a0159\u2013170 (2010)"},{"key":"9343_CR18","unstructured":"Dimopoulos, Y., Nebel, B., Toni, F.: Preferred arguments are harder to compute than stable extensions. In: IJCAI\u201999, pp.\u00a036\u201343 (1999)"},{"key":"9343_CR19","unstructured":"Dimopoulos, Y., Nebel, B., Toni, F.: Finding admissible and preferred arguments can be very hard. In: KR\u201900, pp.\u00a053\u201361 (2000)"},{"key":"9343_CR20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM 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. Artif. Intell. 77, 321\u2013357 (1995)","journal-title":"Artif. Intell."},{"key":"9343_CR21","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"PM Dung","year":"2007","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: Computing ideal skeptical argumentation. Artif. Intell. 171, 642\u2013674 (2007)","journal-title":"Artif. Intell."},{"issue":"10\u201315","key":"9343_CR22","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/j.artint.2007.03.006","volume":"171","author":"P Dunne","year":"2007","unstructured":"Dunne, P.: Computational properties of argument systems satisfying graph-theoretic constraints. Artif. Intell. 171(10\u201315), 701\u2013729 (2007)","journal-title":"Artif. Intell."},{"key":"9343_CR23","unstructured":"Dunne, P., Hunter, A., McBurney, P., Parsons, S., Wooldridge, M.: Inconsistency tolerance in weighted argument systems. In: AAMAS, pp.\u00a0851\u2013858 (2009)"},{"key":"9343_CR24","doi-asserted-by":"crossref","unstructured":"Dunne, P., Wooldridge, M.: Complexity of abstract argumentation. In: Rahwan, I., Simari, G. (eds.) Chapter 5 of Argumentation in Artificial Intelligence, pp.\u00a085\u2013104 (2009)","DOI":"10.1007\/978-0-387-98197-0_5"},{"key":"9343_CR25","doi-asserted-by":"crossref","unstructured":"Egly, U., Gaggl, S., Woltran, S.: ASPARTIX: Implementing argumentation frameworks using answer-set programming. In: International Conference on Logic Programming, pp.\u00a0734\u2013738 (2008)","DOI":"10.1007\/978-3-540-89982-2_67"},{"issue":"3","key":"9343_CR26","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01240738","volume":"11","author":"T Feder","year":"1994","unstructured":"Feder, T.: Network flow and 2-satisfiability. Algorithmica, 11(3), 291\u2013319 (1994)","journal-title":"Algorithmica"},{"key":"9343_CR27","unstructured":"Freuder, E.: Temporal constraint networks. In: IJCAI, pp.\u00a0278\u2013283 (1989)"},{"key":"9343_CR28","doi-asserted-by":"crossref","unstructured":"Krom, M.: The decision problem for a class of first-order formulas in which all disjunctions are binary. eitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik 13, 15\u201320 (1967)","DOI":"10.1002\/malq.19670130104"},{"key":"9343_CR29","first-page":"1004","volume":"2","author":"V Kumar","year":"1987","unstructured":"Kumar, V.: Depth-first search. Encyclopaedia of Artificial Intelligence 2, 1004\u20131005 (1987)","journal-title":"Encyclopaedia of Artificial Intelligence"},{"key":"9343_CR30","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artif. Intell. 138, 39\u201354 (2002)","journal-title":"Artif. Intell."},{"key":"9343_CR31","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-540-75526-5_9","volume":"4766","author":"M Mbarki","year":"2006","unstructured":"Mbarki, M., Bentahar, J., Moulin, B.: Specification and complexity of strategic-based reasoning using argumentation. Argumentation in Multi-Agent Systems. LNAI 4766, 142\u2013160 (2006)","journal-title":"Argumentation in Multi-Agent Systems. LNAI"},{"key":"9343_CR32","unstructured":"Nadel, B.: Some applications of the constraint satisfaction problem. Technical report, Wayne state university (1990)"},{"key":"9343_CR33","unstructured":"R\u00e9gin, J-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the National Conference on Artificial Intelligence, pp.\u00a0209\u2013215 (1996)"},{"key":"9343_CR34","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of constraint programming (foundations of artificial intelligence). Elsevier Science Inc. New York, NY, USA (2006)"},{"key":"9343_CR35","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press. ISBN 0-12-701610-4 (1993)"},{"key":"9343_CR36","doi-asserted-by":"crossref","unstructured":"Walsh, T.: SAT v CSP. In: International Conference on Principles and Practice of Constraint Programming (CP 2000), pp.\u00a0441\u2013456 (2000)","DOI":"10.1007\/3-540-45349-0_32"},{"key":"9343_CR37","unstructured":"Westphal, M., Wolfl, S.: Qualitative csp, finite csp, and sat: Comparing methods for qualitative constraint-based reasoning. In: International Joint Conference on Artificial Intelligence, pp.\u00a0628\u2013633 (2009)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9343-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9343-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9343-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:19:12Z","timestamp":1745975952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9343-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,22]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9343"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9343-0","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2013,3,22]]}}}