{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:54:02Z","timestamp":1759146842605,"version":"3.41.0"},"reference-count":34,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIC"],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.3233\/aic-180769","type":"journal-article","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T14:36:32Z","timestamp":1526654192000},"page":"369-382","source":"Crossref","is-referenced-by-count":5,"title":["New stochastic local search approaches for computing preferred extensions of abstract argumentation"],"prefix":"10.1177","volume":"31","author":[{"given":"Dangdang","family":"Niu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China. E-mails:\u00a0ddniu15@mails.jlu.edu.cn,\u00a0liulei@jlu.edu.cn,\u00a0lus@jlu.edu.cn"}]},{"given":"Lei","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China. E-mails:\u00a0ddniu15@mails.jlu.edu.cn,\u00a0liulei@jlu.edu.cn,\u00a0lus@jlu.edu.cn"}]},{"given":"Shuai","family":"L\u00fc","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun, China. E-mails:\u00a0ddniu15@mails.jlu.edu.cn,\u00a0liulei@jlu.edu.cn,\u00a0lus@jlu.edu.cn"},{"name":"Key Laboratory of Symbolic Computation and Knowledge Engineering (Jilin University), Ministry of Education, Changchun, China"}]}],"member":"179","reference":[{"key":"10.3233\/AIC-180769_ref1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.3152","article-title":"Clause-learning algorithms with many restarts and bounded-width resolution","volume":"40","author":"Atseria","year":"2011","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.3233\/AIC-180769_ref2","doi-asserted-by":"crossref","unstructured":"A.\u00a0Balint and A.\u00a0Frohlich, Improving stochastic local search for SAT with a new probability distribution, in: Proceedings of the 13th Theory and Applications of Satisfiability Testing, Springer, Edinburgh, UK, 2010, pp.\u00a010\u201315.","DOI":"10.1007\/978-3-642-14186-7_3"},{"issue":"5439","key":"10.3233\/AIC-180769_ref3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barabasi","year":"1999","journal-title":"Science"},{"key":"10.3233\/AIC-180769_ref4","unstructured":"P.\u00a0Besnard and S.\u00a0Doutre, Checking the acceptability of a set of arguments, in: Proceedings of the 10th International Workshop on Non-Monotonic Reasoning, Whistler, Canada, 2004, pp.\u00a059\u201364."},{"key":"10.3233\/AIC-180769_ref5","doi-asserted-by":"crossref","unstructured":"S.\u00a0Bistarelli, F.\u00a0Rossi and F.\u00a0Santini, Efficient solution for credulous\/sceptical acceptance in lower-order Dung\u2019s semantic, in: Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, IEEE Computer Society, Limassol, Cyprus, 2014, pp.\u00a0800\u2013804.","DOI":"10.1109\/ICTAI.2014.123"},{"key":"10.3233\/AIC-180769_ref6","doi-asserted-by":"crossref","unstructured":"S.\u00a0Bistarelli, F.\u00a0Rossi and F.\u00a0Santini, Benchmarking hard problems in random abstract AFs: The stable semantics, in: Proceedings of the 5th Conference on Computational Models of Argument, IOS Press, Pitlochry, Scotland, 2014.","DOI":"10.3233\/978-1-61499-436-7-153"},{"key":"10.3233\/AIC-180769_ref7","doi-asserted-by":"crossref","unstructured":"S.\u00a0Bistarelli, F.\u00a0Rossi and F.\u00a0Santini, A first comparison of abstract argumentation reasoning-tools, in: Proceedings of the 21st European Conference on Artificial Intelligence, IOS Press, Prague, Czech Republic, 2014, pp.\u00a0969\u2013970.","DOI":"10.3233\/978-1-61499-419-0-969"},{"issue":"3\u20134","key":"10.3233\/AIC-180769_ref8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.3233\/FI-2015-1254","article-title":"A comparative test on the enumeration of extension in abstract argumentation","volume":"140","author":"Bistarelli","year":"2015","journal-title":"Fundamenta Informaticae"},{"key":"10.3233\/AIC-180769_ref9","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1613\/jair.4260","article-title":"Improved separations of regular resolution from clause learning proof systems","volume":"49","author":"Bonet","year":"2014","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.3233\/AIC-180769_ref10","doi-asserted-by":"crossref","unstructured":"S.\u00a0Cai, C.\u00a0Luo, J.\u00a0Thornton and K.\u00a0Su, Tailing local search for partial MaxSAT, in: Proceedings of the 28th AAAI Conference on Artificial Intelligence, AAAI Press, Qu\u00e9bec City, Qu\u00e9bec, Canada, 2014, pp.\u00a02623\u20132629.","DOI":"10.1609\/aaai.v28i1.9109"},{"key":"10.3233\/AIC-180769_ref11","doi-asserted-by":"crossref","unstructured":"S.\u00a0Cai and K.\u00a0Su, Configuration checking with aspiration in local search for SAT, in: Proceedings of the 26th AAAI Conference on Artificial Intelligence, AAAI Press, Toronto, Ontario, Canada, 2012, pp.\u00a0434\u2013440.","DOI":"10.1609\/aaai.v26i1.8133"},{"issue":"9\u201310","key":"10.3233\/AIC-180769_ref12","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","article-title":"Local search with edge weighting and configuration checking heuristics for minimum vertex cover","volume":"75","author":"Cai","year":"2011","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-180769_ref13","doi-asserted-by":"crossref","unstructured":"F.\u00a0Cerutti, P.E.\u00a0Dunne, M.\u00a0Giacomin and M.\u00a0Vallati, Computing preferred extensions in abstract argumentation: A SAT-based approach, in: Proceedings of the 2nd Theory and Applications of Formal Argumentation, Springer, Beijing, China, 2013, pp.\u00a0176\u2013193.","DOI":"10.1007\/978-3-642-54373-9_12"},{"key":"10.3233\/AIC-180769_ref14","unstructured":"F.\u00a0Cerutti, M.\u00a0Giacomin and M.\u00a0Vallati, ArgSemSAT: Solving argumentation problems using SAT, in: Proceedings of the 5th International Conference on Computational Models of Argument, IOS Press, Scottish Highlands, UK, 2014, pp.\u00a0455\u2013456."},{"key":"10.3233\/AIC-180769_ref15","doi-asserted-by":"crossref","unstructured":"F.\u00a0Cerutti, M.\u00a0Giacomin, M.\u00a0Vallati and M.\u00a0Zanella, An SCC recursive meta-algorithm for computing preferred labellings in abstract argumentation, in: Proceedings of the 14th Principles of Knowledge Representation and Reasoning, AAAI Press, Vienna, Austria, 2014.","DOI":"10.1007\/978-3-642-54373-9_12"},{"key":"10.3233\/AIC-180769_ref16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.artint.2014.11.008","article-title":"Methods for solving reasoning problems in abstract argumentation\u00a0\u2013 a\u00a0survey","volume":"220","author":"Charwat","year":"2015","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-180769_ref17","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dimopoulos and A.\u00a0Sideris, Towards local search for answer sets, in: Proceedings of the 18th International Conference on Logic Programming, Springer, Copenhagen, Denmark, 2002, pp.\u00a0363\u2013377.","DOI":"10.1007\/3-540-45619-8_25"},{"issue":"2","key":"10.3233\/AIC-180769_ref18","doi-asserted-by":"publisher","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":"10.3233\/AIC-180769_ref19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.artint.2013.10.001","article-title":"Complexity-sensitive decision procedures for abstract argumentation","volume":"206","author":"Dvorak","year":"2014","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.3233\/AIC-180769_ref20","first-page":"343","article-title":"On the evolution of random graphs","volume":"38","author":"Erd\u0151s","year":"1961","journal-title":"Bulletin of the Institute of International Statistics"},{"key":"10.3233\/AIC-180769_ref21","unstructured":"S.\u00a0Koenig and M.\u00a0Likhachev, D* Lite, in: Proceedings of the 18th AAAI Conference on Artificial Intelligence, AAAI Press, Edmonton, Alberta, Canada, 2002, pp.\u00a0476\u2013483."},{"key":"10.3233\/AIC-180769_ref22","doi-asserted-by":"crossref","unstructured":"T.\u00a0Laitinen, T.A.\u00a0Junttila and I.\u00a0Niemel\u00e4, Extending clause learning SAT solvers with complete parity reasoning, in: Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, IEEE Computer Society, Athens, Greece, 2012, pp.\u00a065\u201372.","DOI":"10.1109\/ICTAI.2012.18"},{"key":"10.3233\/AIC-180769_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19084-6_26"},{"issue":"1","key":"10.3233\/AIC-180769_ref24","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/A:1027339205632","article-title":"Theorem proving based on the extension rule","volume":"31","author":"Lin","year":"2003","journal-title":"Journal of Automated Reasoning"},{"issue":"5","key":"10.3233\/AIC-180769_ref25","first-page":"1014","article-title":"Clause states based configuration checking in local search for satisfiability","volume":"45","author":"Luo","year":"2015","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"7","key":"10.3233\/AIC-180769_ref26","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","article-title":"CCLS: An efficient local search algorithm for weighted maximum satisfiability","volume":"64","author":"Luo","year":"2015","journal-title":"IEEE Transactions on Computers"},{"key":"10.3233\/AIC-180769_ref27","doi-asserted-by":"crossref","unstructured":"C.\u00a0Martel and V.\u00a0Nguyen, Analyzing Kleinberg\u2019s (and other) small-world models, in: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, ACM, Newfoundland, Canada, 2004, pp.\u00a0179\u2013188.","DOI":"10.1145\/1011767.1011794"},{"key":"10.3233\/AIC-180769_ref28","unstructured":"D.D.\u00a0Niu, L.\u00a0Liu and S.\u00a0L\u00fc, A new stochastic local search approach for computing preferred extensions of abstract argumentation, in: Proceedings of the 22nd European Conference on Artificial Intelligence, IOS Press, The Hague, The Netherlands, 2016, pp.\u00a01652\u20131653."},{"key":"10.3233\/AIC-180769_ref29","doi-asserted-by":"publisher","first-page":"23","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"},{"issue":"1","key":"10.3233\/AIC-180769_ref30","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TCYB.2015.2399616","article-title":"MOD* Lite: An incremental path planning algorithm taking care of multiple objectives","volume":"46","author":"Oral","year":"2016","journal-title":"IEEE Transactions on Cybernetics"},{"key":"10.3233\/AIC-180769_ref31","doi-asserted-by":"crossref","unstructured":"K.\u00a0Pipatsrisawat and A.\u00a0Darwiche, On the power of clause-learning SAT solvers with restarts, in: Proceedings of the 15th Principles and Practice of Constraint Programming, Springer, Lisbon, Portugal, 2009, pp.\u00a0654\u2013668.","DOI":"10.1007\/978-3-642-04244-7_51"},{"key":"10.3233\/AIC-180769_ref32","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.artint.2010.10.002","article-title":"On the power of clause-learning SAT solvers as resolution engines","volume":"175","author":"Pipatsrisawat","year":"2011","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-180769_ref33","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.artint.2017.08.006","article-title":"The first international competition on computational models of argumentation: Results and analysis","volume":"252","author":"Thimm","year":"2017","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-180769_ref34","doi-asserted-by":"crossref","unstructured":"D.A.D.\u00a0Tompkins, A.\u00a0Balint and H.H.\u00a0Hoos, Captain jack: New variable selection heuristics in local search for SAT, in: Proceedings of the 14th Theory and Applications of Satisfiability Testing, Springer, Ann Arbor, MI, USA, 2011, pp.\u00a0302\u2013316.","DOI":"10.1007\/978-3-642-21581-0_24"}],"container-title":["AI Communications"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/AIC-180769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T16:35:01Z","timestamp":1751646901000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/AIC-180769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":34,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/aic-180769","relation":{},"ISSN":["1875-8452","0921-7126"],"issn-type":[{"type":"electronic","value":"1875-8452"},{"type":"print","value":"0921-7126"}],"subject":[],"published":{"date-parts":[[2018,6,11]]}}}