{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:53:57Z","timestamp":1773939237860,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030195694","type":"print"},{"value":"9783030195700","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19570-0_8","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T12:27:54Z","timestamp":1557145674000},"page":"116-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Preprocessing Argumentation Frameworks via Replacement Patterns"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2269-8193","authenticated-orcid":false,"given":"Wolfgang","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2572-063X","authenticated-orcid":false,"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-4071","authenticated-orcid":false,"given":"Thomas","family":"Linsbichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3197-2075","authenticated-orcid":false,"given":"Andreas","family":"Niskanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1594-8972","authenticated-orcid":false,"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1609\/aimag.v38i3.2704","volume":"38","author":"K Atkinson","year":"2017","unstructured":"Atkinson, K., et al.: Towards artificial argumentation. AI Mag. 38(3), 25\u201336 (2017)","journal-title":"AI Mag."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.artint.2014.08.004","volume":"217","author":"P Baroni","year":"2014","unstructured":"Baroni, P., Boella, G., Cerutti, F., Giacomin, M., van der Torre, L., Villata, S.: On the input\/output behavior of argumentation frameworks. Artif. Intell. 217, 144\u2013197 (2014)","journal-title":"Artif. Intell."},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S0269888911000166","volume":"26","author":"P Baroni","year":"2011","unstructured":"Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowl. Eng. Rev. 26(4), 365\u2013410 (2011)","journal-title":"Knowl. Eng. Rev."},{"key":"8_CR4","unstructured":"Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.): Handbook of Formal Argumentation. College Publications (2018)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Baumann, R., Dvo\u0159\u00e1k, W., Linsbichler, T., Woltran, S.: A general notion of equivalence for abstract argumentation. In: Proceedings of IJCAI, pp. 800\u2013806. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/111"},{"issue":"8","key":"8_CR6","first-page":"2623","volume":"4","author":"F Cerutti","year":"2017","unstructured":"Cerutti, F., Gaggl, S.A., Thimm, M., Wallner, J.P.: Foundations of implementations for formal argumentation. IfCoLog J. Log. Appl. 4(8), 2623\u20132707 (2017)","journal-title":"IfCoLog J. Log. Appl."},{"key":"8_CR7","unstructured":"Cerutti, F., Giacomin, M., Vallati, M.: Generating structured argumentation frameworks: AFBenchGen2. In: Proceedings of COMMA. Frontiers in Artificial Intelligence and Applications, vol. 287, pp. 467\u2013468. IOS Press (2016)"},{"key":"8_CR8","unstructured":"Cerutti, F., Vallati, M., Giacomin, M.: Where are we now? State of the art and future trends of solvers for hard argumentation problems. In: Proceedings of COMMA. Frontiers in Artificial Intelligence and Applications, vol. 287, pp. 207\u2013218. IOS Press (2016)"},{"issue":"2","key":"8_CR9","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\u2013358 (1995)","journal-title":"Artif. Intell."},{"key":"8_CR10","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":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61\u201375. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11499107_5"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/19462166.2010.486479","volume":"1","author":"U Egly","year":"2010","unstructured":"Egly, U., Gaggl, S.A., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Argum. Comput. 1(2), 147\u2013177 (2010)","journal-title":"Argum. Comput."},{"key":"8_CR13","unstructured":"Gaggl, S.A., Linsbichler, T., Maratea, M., Woltran, S.: Introducing the second international competition on computational models of argumentation. In: Proceedings of SAFA. CEUR Workshop Proceedings, vol. 1672, pp. 4\u20139. CEUR-WS.org (2016)"},{"key":"8_CR14","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Advanced preprocessing for answer set solving. In: Proceedings of ECAI. Frontiers in Artificial Intelligence and Applications, vol. 178, pp. 15\u201319. IOS Press (2008)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-75553-3_10","volume-title":"Theory and Applications of Formal Argumentation","author":"N Geilen","year":"2018","unstructured":"Geilen, N., Thimm, M.: Heureka: a general heuristic backtracking solver for abstract argumentation. In: Black, E., Modgil, S., Oren, N. (eds.) TAFA 2017. LNCS (LNAI), vol. 10757, pp. 143\u2013149. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-75553-3_10"},{"key":"8_CR16","unstructured":"Giacomin, M., Linsbichler, T., Woltran, S.: On the functional completeness of argumentation semantics. In: Proceedings of KR, pp. 43\u201352. AAAI Press (2016)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1613\/jair.4694","volume":"53","author":"M Heule","year":"2015","unstructured":"Heule, M., J\u00e4rvisalo, M., Lonsing, F., Seidl, M., Biere, A.: Clause elimination for SAT and QSAT. J. Artif. Intell. Res. 53, 127\u2013168 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-31365-3_28","volume-title":"Automated Reasoning","author":"M J\u00e4rvisalo","year":"2012","unstructured":"J\u00e4rvisalo, M., Heule, M.J.H., Biere, A.: Inprocessing rules. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 355\u2013370. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31365-3_28"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-319-66263-3_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"T Korhonen","year":"2017","unstructured":"Korhonen, T., Berg, J., Saikko, P., J\u00e4rvisalo, M.: MaxPre: an extended MaxSAT preprocessor. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 449\u2013456. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-66263-3_28"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-662-48899-7_29","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F Lonsing","year":"2015","unstructured":"Lonsing, F., Bacchus, F., Biere, A., Egly, U., Seidl, M.: Enhancing search-based QBF solving by dynamic blocked clause elimination. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 418\u2013433. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-48899-7_29"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.ijar.2016.07.013","volume":"78","author":"S Nofal","year":"2016","unstructured":"Nofal, S., Atkinson, K., Dunne, P.E.: Looking-ahead in backtracking algorithms for abstract argumentation. Int. J. Approx. Reason. 78, 265\u2013282 (2016)","journal-title":"Int. J. Approx. Reason."},{"key":"8_CR22","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."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19570-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:37:08Z","timestamp":1558348628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19570-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030195694","9783030195700"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19570-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}