{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:38:49Z","timestamp":1740141529561,"version":"3.37.3"},"reference-count":35,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2017,11,23]],"date-time":"2017-11-23T00:00:00Z","timestamp":1511395200000},"content-version":"vor","delay-in-days":1,"URL":"http:\/\/academic.oup.com\/journals\/pages\/about_us\/legal\/notices"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities of China","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001866","name":"National Research Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001866","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,3,6]]},"DOI":"10.1093\/logcom\/exx035","type":"journal-article","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T19:28:17Z","timestamp":1508873297000},"page":"305-335","source":"Crossref","is-referenced-by-count":3,"title":["Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results"],"prefix":"10.1093","volume":"28","author":[{"given":"Beishui","family":"Liao","sequence":"first","affiliation":[{"name":"Center for the Study of Language and Cognition, Zhejiang University, Hangzhou, China"},{"name":"Institute of Logic and Cognition, Zhejiang University, Hangzhou, China"},{"name":"University of Luxembourg, L-4365 Esch-sur-Alzette, Luxembourg"}]},{"given":"Kang","family":"Xu","sequence":"additional","affiliation":[{"name":"Center for the Study of Language and Cognition, Zhejiang University, Hangzhou, China"},{"name":"Institute of Logic and Cognition, Zhejiang University, Hangzhou, China"}]},{"given":"Huaxin","family":"Huang","sequence":"additional","affiliation":[{"name":"Center for the Study of Language and Cognition, Zhejiang University, Hangzhou, China"},{"name":"Institute of Logic and Cognition, Zhejiang University, Hangzhou, China"}]}],"member":"286","published-online":{"date-parts":[[2017,11,22]]},"reference":[{"key":"key\n\t\t\t\t20180328153849_B1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1017\/S0269888911000166","article-title":"An introduction to argumentation semantics.","volume":"26","author":"Baroni","year":"2011","journal-title":"The Knowledge Engineering Review"},{"key":"key\n\t\t\t\t20180328153849_B2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.artint.2005.05.006","article-title":"Scc-recursiveness: a general schema for argumentation semantics.","volume":"168","author":"Baroni","year":"2005","journal-title":"Artificial Intelligence"},{"key":"key\n\t\t\t\t20180328153849_B3","first-page":"42","article-title":"An scc recursive meta-algorithm for computing preferred labellings in abstract argumentation.","volume-title":"Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning, KR 2014","author":"Cerutti","year":"2014"},{"key":"key\n\t\t\t\t20180328153849_B4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/11518655_28","article-title":"Symmetric argumentation frameworks.","volume-title":"Proceedings of the 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005)","author":"Coste-Marquis","year":"2005"},{"key":"key\n\t\t\t\t20180328153849_B5","first-page":"317","article-title":"Symmetric argumentation frameworks.","volume-title":"Proceedings of the ECSQARU 2005","author":"Coste-Marquis","year":"2005"},{"key":"key\n\t\t\t\t20180328153849_B6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","article-title":"Graph theoretical structures in logic programs and default theories.","volume":"170","author":"Dimopoulos","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"key\n\t\t\t\t20180328153849_B7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games.","volume":"77","author":"Dung.","year":"1995","journal-title":"Artificial Intelligence"},{"key":"key\n\t\t\t\t20180328153849_B8","first-page":"171","article-title":"Towards (probabilistic) argumentation for jury-based dispute resolution.","volume-title":"Proceedings of the COMMA 2010","author":"Dung","year":"2010"},{"key":"key\n\t\t\t\t20180328153849_B9","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/j.artint.2007.03.006","article-title":"Computational properties of argument systems satisfying graph-theoretic constraints.","volume":"171","author":"Dunne.","year":"2007","journal-title":"Artificial Intelligence"},{"key":"key\n\t\t\t\t20180328153849_B10","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.artint.2010.09.005","article-title":"Weighted argument systems: basic definitions, algorithms, and complexity results.","volume":"175","author":"Dunne","year":"2011","journal-title":"Artificial Intelligence"},{"key":"key\n\t\t\t\t20180328153849_B11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-0-387-98197-0_5","article-title":"Complexity of abstract argumentation.","volume-title":"Argumentation in Artificial Intelligence","author":"Dunne","year":"2009"},{"key":"key\n\t\t\t\t20180328153849_B12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.artint.2012.03.002","article-title":"Augmenting tractable fragments of abstract argumentation.","volume":"186","author":"Dvo\u0159\u00e1k","year":"2012","journal-title":"Artificial Intelligence"},{"key":"key\n\t\t\t\t20180328153849_B13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2012.03.005","article-title":"Towards fixed-parameter tractable algorithms for abstract argumentation.","volume":"186","author":"Dvo\u0159\u00e1k","year":"2012","journal-title":"Artificial Intelligence"},{"key":"key\n\t\t\t\t20180328153849_B14","first-page":"219","article-title":"Reasoning in argumentation frameworks of bounded clique-width.","volume-title":"Proceedings of the 3rd Conference on Computational Models of Argument, COMMA 2010","author":"Dvo\u0159\u00e1k","year":"2010"},{"key":"key\n\t\t\t\t20180328153849_B15","first-page":"69","article-title":"On a formal connection between truth, argumentation and belief.","volume-title":"Proceedings of the ESSLLI 2012\/2013, LNCS 8607","author":"Dyrkolbotn.","year":"2014"},{"key":"key\n\t\t\t\t20180328153849_B16","first-page":"898","article-title":"On the complexity of probabilistic abstract argumentation.","volume-title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","author":"Fazzinga","year":"2013"},{"key":"key\n\t\t\t\t20180328153849_B17","article-title":"On the complexity of probabilistic abstract argumentation frameworks.","volume":"16","author":"Fazzinga","year":"2015","journal-title":"Transactions on Computational Logic"},{"key":"key\n\t\t\t\t20180328153849_B18","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ijar.2015.11.009","article-title":"On efficiently estimating the probability of extensions in abstract argumentation frameworks.","volume":"69","author":"Fazzinga","year":"2016","journal-title":"International Journal of Approximate Reasoning"},{"volume-title":"Parameterized Complexity Theory","year":"2006","author":"Flum","key":"key\n\t\t\t\t20180328153849_B19"},{"key":"key\n\t\t\t\t20180328153849_B20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(84)90131-6","article-title":"On kernels and semikernels of digraph.","volume":"48","author":"Galeana-S\u00e1nchez","year":"1984","journal-title":"Discrete Mathematics"},{"key":"key\n\t\t\t\t20180328153849_B21","first-page":"143","article-title":"Audience-based uncertainty in abstract argument games.","volume-title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","author":"Grossi","year":"2013"},{"key":"key\n\t\t\t\t20180328153849_B22","first-page":"117","article-title":"Some foundations for probabilistic abstract argumentation.","volume-title":"Proceedings of the 4th International Conference on Computational Models of Argument","author":"Hunter.","year":"2012"},{"key":"key\n\t\t\t\t20180328153849_B23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ijar.2012.08.003","article-title":"A probabilistic approach to modelling uncertain logical arguments.","volume":"54","author":"Hunter.","year":"2013","journal-title":"International Journal of Approximate Reasoning"},{"key":"key\n\t\t\t\t20180328153849_B24","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/j.ijar.2013.09.002","article-title":"Probabilistic qualification of attack in abstract argumentation.","volume":"55","author":"Hunter.","year":"2014","journal-title":"International Journal of Approximate Reasoning"},{"key":"key\n\t\t\t\t20180328153849_B25","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1093\/logcom\/9.2.215","article-title":"Robust semantics for argumentation frameworks.","volume":"9","author":"Jakobovits","year":"1999","journal-title":"Journal of Logic and Computation"},{"key":"key\n\t\t\t\t20180328153849_B26","first-page":"1","article-title":"Probabilistic argumentation frameworks.","volume-title":"Proceedings of the TAFA 2011","author":"Li","year":"2012"},{"key":"key\n\t\t\t\t20180328153849_B27","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10472-013-9364-8","article-title":"Toward incremental computation of argumentation semantics: a decomposition-based approach.","volume":"67","author":"Liao.","year":"2013","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"key\n\t\t\t\t20180328153849_B28","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1093\/logcom\/exs047","article-title":"Partial semantics of argumentation: basic properties and empirical results.","volume":"23","author":"Liao","year":"2013","journal-title":"Journal of Logic and Computation"},{"key":"key\n\t\t\t\t20180328153849_B29","first-page":"243","article-title":"Formulating semantics of probabilistic argumentation by characterizing subgraphs.","volume-title":"Proceedings of the LORI 2015","author":"Liao","year":"2015"},{"volume-title":"Parameterized Algorithms","year":"2015","author":"Lokshtanov","key":"key\n\t\t\t\t20180328153849_B30"},{"key":"key\n\t\t\t\t20180328153849_B31","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-0-387-98197-0_6","article-title":"Proof theories and algorithms for abstract argumentation frameworks.","volume-title":"Argumentation in Artificial Intelligence","author":"Modgil","year":"2009"},{"key":"key\n\t\t\t\t20180328153849_B32","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.artint.2013.11.001","article-title":"Algorithms for decision problems in argument systems under preferred semantics.","volume":"207","author":"Nofal","year":"2014","journal-title":"Artificial Intelligence"},{"key":"key\n\t\t\t\t20180328153849_B33","first-page":"138","article-title":"Towards a probabilistic dung-style argumentation system.","author":"Rienstra.","year":"2012","journal-title":"Proceedings of the AT"},{"key":"key\n\t\t\t\t20180328153849_B34","first-page":"750","article-title":"A probabilistic semantics for abstract argumentation.","volume-title":"European Conference on Artificial Intelligence (ECAI)","author":"Thimm.","year":"2012"},{"key":"key\n\t\t\t\t20180328153849_B35","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.jda.2011.11.004","article-title":"Finding kernels or solving sat.","volume":"10","author":"Walicki","year":"2012","journal-title":"Journal of Discrete Algorithms"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/28\/2\/305\/24261826\/exx035.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T11:34:45Z","timestamp":1589801685000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/28\/2\/305\/4653526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,22]]},"references-count":35,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,11,22]]},"published-print":{"date-parts":[[2018,3,6]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exx035","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"type":"print","value":"0955-792X"},{"type":"electronic","value":"1465-363X"}],"subject":[],"published-other":{"date-parts":[[2018,3]]},"published":{"date-parts":[[2017,11,22]]}}}