{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:40:04Z","timestamp":1750192804046,"version":"3.41.0"},"reference-count":24,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016edp7313","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T22:23:58Z","timestamp":1490999038000},"page":"838-848","source":"Crossref","is-referenced-by-count":4,"title":["Encoding Argumentation Semantics by Boolean Algebra"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Fuan","family":"PU","sequence":"first","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guiming","family":"LUO","sequence":"additional","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"JIANG","sequence":"additional","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] P.M. Dung, \u201cOn the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games,\u201d J. AI, vol.77, no.2, pp.321-357, Sept. 1995.","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] P. Baroni, M. Caminada, and M. Giacomin, \u201cAn introduction to argumentation semantics,\u201d The Knowledge Engineering Review, vol.26, pp.365-410, 12 2011.","DOI":"10.1017\/S0269888911000166"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] G. Charwat, W. Dvo\u0159\u00e1k, S.A. Gaggl, J.P. Wallner, and S. Woltran, \u201cMethods for solving reasoning problems in abstract argumentation-a survey,\u201d Artificial intelligence, vol.220, pp.28-63, 2015.","DOI":"10.1016\/j.artint.2014.11.008"},{"key":"4","unstructured":"[4] D. Grossi and S. Modgil, \u201cOn the graded acceptability of arguments,\u201d Proc. Twenty-Fourth International Joint Conference on Artificial Intelligence, pp.868-874, IJCAI, 2015."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] P. Besnard and A. Hunter, Elements of argumentation, MIT Press, Cambridge, 2008.","DOI":"10.7551\/mitpress\/9780262026437.001.0001"},{"key":"6","unstructured":"[6] J.E. Whitesitt, Boolean algebra and its applications, Courier Corporation, 1995."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] S. Givant and P. Halmos, Introduction to Boolean algebras, Springer Science & Business Media, 2008.","DOI":"10.1007\/978-0-387-68436-9_2"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] F. Pu, J. Luo, and G. Luo, \u201cSome supplementaries to the counting semantics for abstract argumentation,\u201d IEEE 27th International Conference on Tools with Artifi. Intelli., pp.242-249, 2015.","DOI":"10.1109\/ICTAI.2015.46"},{"key":"9","unstructured":"[9] E. Hadjisoteriou, \u201cComputing Argumentation with Matrices,\u201d Imperial College Computing Student Workshop, pp.29-36, 2015."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] P. Codognet and D. Diaz, \u201cA simple and efficient boolean solver for constraint logic programming,\u201d J. Automated Reasoning, vol.17, no.1, pp.97-128, 1996.","DOI":"10.1007\/BF00247670"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] J.P. Wallner, G. Weissenbacher, and S. Woltran, \u201cAdvanced SAT techniques for abstract argumentation,\u201d Int'l Workshop on Computational Logic in Multi-Agent Systems, pp.138-154, Springer, 2013.","DOI":"10.1007\/978-3-642-40624-9_9"},{"key":"12","unstructured":"[12] F. Cerutti, M. Giacomin, and M. Vallati, \u201cArgSemSAT: Solving argumentation problems using SAT,\u201d COMMA, pp.455-456, 2014."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] J.M. Lagniez, E. Lonca, and J.G. Mailly, \u201cCoQuiAAS: A constraint-based quick abstract argumentation solver,\u201d IEEE 27th International Conference on Tools with Artifi. Intelli., pp.928-935, 2015.","DOI":"10.1109\/ICTAI.2015.134"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] J. Jaffar and M.J. Maher, \u201cConstraint logic programming: A survey,\u201d The journal of logic programming, vol.19, pp.503-581, 1994.","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"15","unstructured":"[15] R. Drechsler and B. Becker, Binary decision diagrams: theory and implementation, Springer Science & Business Media, 2013."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] M. Triska, \u201cThe boolean constraint solver of SWI-Prolog: System description,\u201d FLOPS, LNCS, vol.9613, pp.45-61, 2016.","DOI":"10.1007\/978-3-319-29604-3_4"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] M. Thimm, \u201cSummary report of the first international competition on computational models of argumentation,\u201d AI Magazine, vol.37, no.1, pp.102-104, 2016.","DOI":"10.1609\/aimag.v37i1.2640"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] S. Bistarelli, F. Rossi, and F. Santini, \u201cBenchmarking hard problems in random abstract AFs: The stable semantics,\u201d COMMA, 2014.","DOI":"10.3233\/978-1-61499-436-7-153"},{"key":"19","unstructured":"[19] Y. Xu, \u201cA matrix approach for computing extensions of argumentation frameworks,\u201d CoRR, vol.abs\/1209.1899, 2012."},{"key":"20","unstructured":"[20] E. Hadjisoteriou and M. Georgiou, \u201cASSA: Computing stable extensions with matrices,\u201d System Descriptions of the First International Competition on Computational Models of Argumentation, 2015."},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] V. No\u00ebl and A. Kakas, \u201cGorgias-c: Extending argumentation with constraint solving,\u201d in Logic Programming and Nonmonotonic Reasoning, pp.535-541, Springer, 2009.","DOI":"10.1007\/978-3-642-04238-6_54"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] S. Bistarelli and F. Santini, \u201cConarg: A constraint-based computational framework for argumentation systems,\u201d IEEE International Conference on Tools with Artifi. Intelli., pp.605-612, 2011.","DOI":"10.1109\/ICTAI.2011.96"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] L. Amgoud and C. Devred, \u201cArgumentation frameworks as constraint satisfaction problems,\u201d Annals of Mathematics and Artifi. Intelli., vol.69, no.1, pp.131-148, 2013.","DOI":"10.1007\/s10472-013-9343-0"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] U. Egly, S.A. Gaggl, and S. Woltran, \u201cAspartix: Implementing argumentation frameworks using answer-set programming,\u201d in Logic Programming, pp.734-738, Springer, 2008.","DOI":"10.1007\/978-3-540-89982-2_67"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/4\/E100.D_2016EDP7313\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:22Z","timestamp":1750191142000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/4\/E100.D_2016EDP7313\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7313","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2017]]}}}