{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:55:06Z","timestamp":1743008106991,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819601271"},{"type":"electronic","value":"9789819601288"}],"license":[{"start":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:00:00Z","timestamp":1731369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:00:00Z","timestamp":1731369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-0128-8_19","type":"book-chapter","created":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T18:17:13Z","timestamp":1731781033000},"page":"216-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An In-Label Prioritizing Variable Branching Strategy of\u00a0SAT Solvers for\u00a0a\u00a0Preferred Extension of\u00a0Argumentation Frameworks"],"prefix":"10.1007","author":[{"given":"Mao","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiao","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ningning","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caiquan","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,12]]},"reference":[{"key":"19_CR1","unstructured":"Alviano, M.: The pyglaf argumentation reasoner. In: Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"19_CR2","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Twenty-First International Joint Conference on Artificial Intelligence. Citeseer (2009)"},{"issue":"1\u20132","key":"19_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.artint.2005.05.006","volume":"168","author":"P Baroni","year":"2005","unstructured":"Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: a general schema for argumentation semantics. Artif. Intell. 168(1\u20132), 162\u2013210 (2005)","journal-title":"Artif. Intell."},{"key":"19_CR4","unstructured":"Besnard, P., Doutre, S.: Checking the acceptability of a set of arguments. In: NMR, vol.\u00a04, pp. 59\u201364 (2004)"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Biere, A., Fr\u00f6hlich, A.: Evaluating CDCL variable scoring schemes. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 405\u2013422. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_29","DOI":"10.1007\/978-3-319-24318-4_29"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11853886_11","volume-title":"Logics in Artificial Intelligence","author":"M Caminada","year":"2006","unstructured":"Caminada, M.: On the issue of reinstatement in argumentation. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 111\u2013123. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11853886_11"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2019.08.001","volume":"276","author":"F Cerutti","year":"2019","unstructured":"Cerutti, F., Giacomin, M., Vallati, M.: How we designed winning algorithms for abstract argumentation and which insight we attained. Artif. Intell. 276, 1\u201340 (2019)","journal-title":"Artif. Intell."},{"key":"19_CR8","first-page":"455","volume":"14","author":"F Cerutti","year":"2014","unstructured":"Cerutti, F., Giacomin, M., Vallati, M., et al.: Argsemsat: solving argumentation problems using SAT. COMMA 14, 455\u2013456 (2014)","journal-title":"COMMA"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ijar.2017.10.002","volume":"92","author":"F Cerutti","year":"2018","unstructured":"Cerutti, F., Vallati, M., Giacomin, M.: On the impact of configuration on abstract argumentation automated reasoning. Int. J. Approxim. Reason. 92, 120\u2013138 (2018)","journal-title":"Int. J. Approxim. Reason."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.artint.2014.11.008","volume":"220","author":"G Charwat","year":"2015","unstructured":"Charwat, G., Dvo\u0159\u00e1k, W., Gaggl, S.A., Wallner, J.P., Woltran, S.: Methods for solving reasoning problems in abstract argumentation-a survey. Artif. Intell. 220, 28\u201363 (2015)","journal-title":"Artif. Intell."},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/371578.371581","volume":"32","author":"CI Chesnevar","year":"2000","unstructured":"Chesnevar, C.I., Maguitman, A.G., Loui, R.P.: Logical models of argument. ACM Comput. Surv. 32(4), 337\u2013383 (2000)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","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(2), 321\u2013357 (1995)","journal-title":"Artif. Intell."},{"key":"19_CR13","unstructured":"Dvor\u00e1k, W., J\u00e4rvisalo, M., Wallner, J.P.: Cegartix v2017-3-13: a SAT-based counter-example guided argumentation reasoning tool. In: Second International Competition on Computational Models of Argumentation (2017)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.artint.2013.10.001","volume":"206","author":"W Dvo\u0159\u00e1k","year":"2014","unstructured":"Dvo\u0159\u00e1k, W., J\u00e4rvisalo, M., Wallner, J.P., Woltran, S.: Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell. 206, 53\u201378 (2014)","journal-title":"Artif. Intell."},{"key":"19_CR15","first-page":"50","volume":"2020","author":"A Fleury","year":"2020","unstructured":"Fleury, A., Heisinger, M.: Cadical, kissat, paracooba, plingeling and treengeling entering the sat competition 2020. Sat Competition 2020, 50 (2020)","journal-title":"Sat Competition"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Gao, Y.: A random model for argumentation framework: phase transitions, empirical hardness, and heuristics. In: International Joint Conference on Artificial Intelligence, pp. 503\u2013509 (2017)","DOI":"10.24963\/ijcai.2017\/71"},{"key":"19_CR17","unstructured":"Hoos, H.H., St\u00fctzle, T.: Satlib: An Online Resource for Research on SAT (2000)"},{"key":"19_CR18","unstructured":"Kinder, L., Thimm, M., Verheij, B.: A labelling-based solver for computing complete extensions of abstract argumentation frameworks (2022)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Lagniez, J.M., Lonca, E., Mailly, J.G.: Coquiaas: a constraint-based quick abstract argumentation solver. In: 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 928\u2013935. IEEE (2015)","DOI":"10.1109\/ICTAI.2015.134"},{"key":"19_CR20","unstructured":"Lagniez, J.M., Lonca, E., Mailly, J.G.: A SAT-based approach for argumentation dynamics. In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, pp. 2351\u20132353 (2024)"},{"key":"19_CR21","unstructured":"Lagniez, J.M., Lonca, E., Mailly, J.G., Rossit, J.: Design and results of ICCMA 2021. arXiv preprint arXiv:2109.08884 (2021)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Liang, J., Ganesh, V., Poupart, P., Czarnecki, K.: Exponential regency weighted average branching heuristic for SAT solvers. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a030 (2016)","DOI":"10.1609\/aaai.v30i1.10439"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-40970-2_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"JH Liang","year":"2016","unstructured":"Liang, J.H., Ganesh, V., Poupart, P., Czarnecki, K.: Learning rate based branching heuristic for SAT solvers. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 123\u2013140. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_9"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Liang, J.H., Ganesh, V., Zulkoski, E., Zaman, A., Czarnecki, K.: Understanding VSIDS branching heuristics in conflict-driven clause-learning SAT solvers. In: Hardware and Software: Verification and Testing: 11th International Haifa Verification Conference, HVC 2015, Haifa, 17\u201319 November 2015, Proceedings 11, pp. 225\u2013241. Springer (2015)","DOI":"10.1007\/978-3-319-26287-1_14"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"19_CR26","unstructured":"Niskanen, A., J\u00e4rvisalo, M.: $$\\mu $$-toksia in ICCMA 2023. In: ICCMA, p.\u00a031 (2023)"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Niskanen, A., J\u00e4rvisalo, M.: $$\\mu $$-toksia: an efficient abstract argumentation reasoner. In: International Conference on Principles of Knowledge Representation and Reasoning, pp. 800\u2013804. International Joint Conference on Artificial Intelligence, Inc. (2020)","DOI":"10.24963\/kr.2020\/82"},{"key":"19_CR28","unstructured":"Pu, F., Ya, H., Luo, G.: Argmat-dvisat: a division-based algorithm framework for solving argumentation problems using SAT. Int. Compet. Comput. Models Argument. (2017)"},{"key":"19_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0","volume-title":"Argumentation in Artificial Intelligence","year":"2009","unstructured":"Simari, G., Rahwan, I. (eds.): Argumentation in Artificial Intelligence. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-98197-0"},{"key":"19_CR30","doi-asserted-by":"publisher","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_24","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"S\u00f6rensson, N., E\u00e9n, N.: Minisat v1.13 - a SAT solver with conflict-clause minimization. In: SAT, vol.\u00a02005, pp.\u00a01\u20132 (2005)","DOI":"10.3233\/SAT190014"},{"key":"19_CR32","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.artint.2017.08.006","volume":"252","author":"M Thimm","year":"2017","unstructured":"Thimm, M., Villata, S.: The first international competition on computational models of argumentation: Results and analysis. Artif. Intell. 252, 267\u2013294 (2017)","journal-title":"Artif. Intell."},{"issue":"1","key":"19_CR33","first-page":"102","volume":"37","author":"M Thimm","year":"2016","unstructured":"Thimm, M., Villata, S., Cerutti, F., Oren, N., Strass, H., Vallati, M.: Summary report of the first international competition on computational models of argumentation. AI Mag. 37(1), 102\u2013104 (2016)","journal-title":"AI Mag."},{"issue":"7","key":"19_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-017-9467-7","volume":"62","author":"F Xiao","year":"2019","unstructured":"Xiao, F., Li, C.-M., Luo, M., Many\u00e0, F., L\u00fc, Z., Li, Yu.: A branching heuristic for SAT solvers based on complete implication graphs. Sci. China Inf. Sci. 62(7), 1\u201313 (2019). https:\/\/doi.org\/10.1007\/s11432-017-9467-7","journal-title":"Sci. China Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","PRICAI 2024: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0128-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T19:24:46Z","timestamp":1731785086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0128-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,12]]},"ISBN":["9789819601271","9789819601288"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0128-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,12]]},"assertion":[{"value":"12 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}