{"type":"ScholarlyArticle","title":"Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving","authors":[{"name":"Thomas Linsbichler","slug":"thomas-linsbichler","given":"Thomas","family":"Linsbichler","affiliation":"Institute of Logic and Computation , TU Wien , Austria,"},{"name":"Marco Maratea","slug":"marco-maratea","given":"Marco","family":"Maratea","affiliation":"DIBRIS , University of Genova , Italy,"},{"name":"Andreas Niskanen","slug":"andreas-niskanen","given":"Andreas","family":"Niskanen","affiliation":"HIIT , Department of Computer Science , University of Helsinki , Finland"},{"name":"Johannes P. Wallner","slug":"johannes-p-wallner","given":"Johannes P.","family":"Wallner","affiliation":"Institute of Logic and Computation , TU Wien , Austria,"},{"name":"Stefan Woltran","slug":"stefan-woltran","given":"Stefan","family":"Woltran","affiliation":"Institute of Logic and Computation , TU Wien , Austria,"}],"abstract":"Abstract dialectical frameworks (ADFs) constitute one of the most powerful formalisms in abstract argumentation. Their high computational complexity poses, however, certain challenges when designing efficient systems. In this paper, we tackle this issue by (i) analyzing the complexity of ADFs under structural restrictions, (ii) presenting novel algorithms which make use of these insights, and (iii) empirically evaluating a resulting implementation which relies on calls to SAT solvers.","doi":"10.24963/ijcai.2018/263","url":"https://ijcai.org/proceedings/2018/263","pdf":"https://ijcai.org/proceedings/2018/0263.pdf","markdown":"https://ijcai.org/proceedings/2018/263.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/263","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":263,"pages":{"first":1905,"last":1911},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Knowledge Representation and Reasoning: Computational Models of Argument"],"videos":[],"references":[{"position":1,"raw":"[Al-Abdulkarim et al., 2016] L. Al-Abdulkarim, K. Atkin- son, and T. J. M. Bench-Capon. A methodology for de- signing systems to reason with legal cases using abstract dialectical frameworks. Artif. Intell. Law, 24(1):1-49, 2016.","title":"A methodology for designing systems to reason with legal cases using abstract dialectical frameworks","authors":"Al-Abdulkarim","year":"2016","venue":"Artif. Intell. Law","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Atkinson et al., 2017] K. Atkinson, P. Baroni, M. Gia- comin, A. Hunter, H. Prakken, C. Reed, G. R. Simari, M. Thimm, and S. Villata. Towards artificial argumentation. AI Magazine, 38(3):25-36, 2017.","title":"Towards artificial argumentation","authors":"K Atkinson, P Baroni, M Giacomin, A Hunter, H Prakken, C Reed, G R Simari, M Thimm, S Villata","year":"2017","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bench-Capon and Dunne, 2007] T. J. M. Bench-Capon and P. E. Dunne. Argumentation in artificial intelligence. Artif. Intell., 171(10-15):619-641, 2007.","title":"Argumentation in artificial intelligence","authors":"T J M Bench-Capon, P E Dunne","year":"2007","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bichler et al., 2016] M. Bichler, M. Morak, and S. Woltran. lpopt: A rule optimization tool for answer set program- ming. In Proc. LOPSTR, pages 114-130, 2016.","title":"lpopt: A rule optimization tool for answer set programming","authors":"M Bichler, M Morak, S Woltran","year":"2016","venue":"Proc. LOPSTR","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Biere et al., 2011] A. Biere, F. Lonsing, and M. Seidl. Blocked clause elimination for QBF. In Proc. CADE, pages 101-115, 2011.","title":"Blocked clause elimination for QBF","authors":"A Biere, F Lonsing, M Seidl","year":"2011","venue":"Proc. CADE","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Brewka and Woltran, 2010] G. Brewka and S. Woltran. Ab- stract dialectical frameworks. In Proc. KR, pages 102-111, 2010.","title":"Abstract dialectical frameworks","authors":"G Brewka, S Woltran","year":"2010","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brewka et al., 2017a] G. Brewka, M. Diller, G. Heis- senberger, T. Linsbichler, and S. Woltran. Solving ad- vanced argumentation problems with answer-set program- ming. In Proc. AAAI, pages 1077-1083. 2017.","title":"Solving advanced argumentation problems with answer-set programming","authors":"Brewka","year":"2017","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Brewka et al., 2017b] G. Brewka, S. Ellmauthaler, H. Strass, J. P. Wallner, and S. Woltran. Abstract dialecti- cal frameworks. An overview. IfCoLog Journal of Logics and their Applications, 4(8):2263-2318, 2017.","title":"Abstract dialectical frameworks. An overview","authors":"Brewka","year":"2017","venue":"IfCoLog Journal of Logics and their Applications","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Cabrio and Villata, 2016] E. Cabrio and S. Villata. Ab- stract dialectical frameworks for text exploration. In Proc. ICAART, pages 85-95, 2016.","title":"Abstract dialectical frameworks for text exploration","authors":"E Cabrio, S Villata","year":"2016","venue":"Proc. ICAART","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cayrol and Lagasquie-Schiex, 2013] C. Cayrol and M.-C. Lagasquie-Schiex. Bipolarity in argumentation graphs: Towards a better understanding. Int. J. Approx. Reason- ing, 54(7):876-899, 2013.","title":"Bipolarity in argumentation graphs: Towards a better understanding","authors":"C Cayrol, M.-C Lagasquie-Schiex","year":"2013","venue":"Int. J. Approx. Reasoning","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Cerutti et al., 2014] F. Cerutti, M. Giacomin, and M. Vallati. ArgSemSAT: Solving argumentation problems using SAT. In Proc. COMMA, pages 455-456, 2014.","title":"ArgSemSAT: Solving argumentation problems using SAT","authors":"F Cerutti, M Giacomin, M Vallati","year":"2014","venue":"Proc. COMMA","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Charwat et al., 2015] G. Charwat, W. Dvořák, S. A. Gaggl, J. P. Wallner, and S. Woltran. Methods for solving reason- ing problems in abstract argumentation -A survey. Artif. Intell., 220:28-63, 2015.","title":"Methods for solving reasoning problems in abstract argumentation -A survey","authors":"G Charwat, W Dvořák, S A Gaggl, J P Wallner, S Woltran","year":"2015","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Diller et al., 2015] M. Diller, J. P. Wallner, and S. Woltran. Reasoning in abstract dialectical frameworks using quan- tified Boolean formulas. Argument & Computation, 6(2):149-177, 2015.","title":"Reasoning in abstract dialectical frameworks using quantified Boolean formulas","authors":"M Diller, J P Wallner, S Woltran","year":"2015","venue":"Argument & Computation","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Dung, 1995] P. M, Dung. On the acceptability of argu- ments and its fundamental role in nonmonotonic reason- ing, logic programming and n-person games. Artif. Intell., 77(2):321-357, 1995.","title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games","authors":"P M, Dung","year":"1995","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Dunne, 2009] P. E. Dunne. The computational complex- ity of ideal semantics. Artif. Intell., 173(18):1559-1591, 2009.","title":"The computational complexity of ideal semantics","authors":"P E Dunne","year":"2009","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Dvořák et al., 2012] W. Dvořák, S. Ordyniak, and S. Szei- der. Augmenting tractable fragments of abstract argumen- tation. Artif.Intell., 186:157-173, 2012.","title":"Augmenting tractable fragments of abstract argumentation","authors":"W Dvořák, S Ordyniak, S Szeider","year":"2012","venue":"Artif.Intell","doi":null,"url":null,"internal_url":"/proceedings/2011/177"},{"position":17,"raw":"[Dvořák et al., 2014] W. Dvořák, M. Järvisalo, J. P. Wallner, and S. Woltran. Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell., 206:53-78, 2014.","title":"Complexity-sensitive decision procedures for abstract argumentation","authors":"W Dvořák, M Järvisalo, J P Wallner, S Woltran","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Eén and Sörensson, 2003] N. Eén and N. Sörensson. An ex- tensible SAT-solver. In Proc. SAT, pages 502-518, 2003.","title":"An extensible SAT-solver","authors":"N Eén, N Sörensson","year":"2003","venue":"Proc. SAT","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gebser et al., 2016] M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and Philipp Wanko. Theory solving made easy with clingo 5. In Techn. Commun. of ICLP, pages 2:1-2:15, 2016.","title":"Theory solving made easy with clingo 5","authors":"M Gebser, R Kaminski, B Kaufmann, M Ostrowski, T Schaub, Philipp Wanko","year":"2016","venue":"Techn. Commun. of ICLP","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Keshavarzi, 2017] A. Keshavarzi. Investigating subclasses of abstract dialectical frameworks. Master's thesis, TU Wien, 2017.","title":"Investigating subclasses of abstract dialectical frameworks","authors":"A Keshavarzi","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lonsing and Egly, 2017] F. Lonsing and U. Egly. De- pQBF 6.0: A search-based QBF solver beyond traditional QCDCL. In Proc. CADE, pages 371-384, 2017.","title":"De-pQBF 6.0: A search-based QBF solver beyond traditional QCDCL","authors":"F Lonsing, U Egly","year":"2017","venue":"Proc. CADE","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Neugebauer, 2017] D. Neugebauer. Generating defeasible knowledge bases from real-world argumentations using D- BAS. In Proc. AI 3@AI*IA, pages 105-110, 2017.","title":"Generating defeasible knowledge bases from real-world argumentations using D-BAS","authors":"D Neugebauer","year":"2017","venue":"Proc. AI 3@AI*IA","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Nielsen and Parsons, 2007] S. Nielsen and S. Parsons. A generalization of Dung's abstract framework for argumen- tation: Arguing with sets of attacking arguments. In Proc. ArgMAS, pages 54-73. 2007.","title":"A generalization of Dung's abstract framework for argumentation: Arguing with sets of attacking arguments","authors":"S Nielsen, S Parsons","year":"2007","venue":"Proc. ArgMAS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Polberg, 2016] S. Polberg. Understanding the abstract di- alectical framework. In Proc. JELIA, pages 430-446, 2016.","title":"Understanding the abstract dialectical framework","authors":"S Polberg","year":"2016","venue":"Proc. JELIA","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Strass and Ellmauthaler, 2017] H. Strass and S. Ellmautha- ler. goDiamond 0.6.6. argumentationcompetition. org/2017/goDIAMOND.pdf, 2017.","title":"goDiamond","authors":"H Strass, S Ellmauthaler","year":"2017","venue":"goDiamond","doi":null,"url":"argumentationcompetition.org/2017/goDIAMOND.pdf","internal_url":null},{"position":26,"raw":"[Strass and Wallner, 2015] H. Strass and J. P. Wallner. An- alyzing the computational complexity of abstract dialecti- cal frameworks via approximation fixpoint theory. Artif. Intell., 226:34-74, 2015.","title":"Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory","authors":"H Strass, J P Wallner","year":"2015","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Strass, 2014] H. Strass. Implementing instantiation of knowledge bases in argumentation frameworks. In Proc. COMMA, pages 475-476, 2014.","title":"Implementing instantiation of knowledge bases in argumentation frameworks","authors":"H Strass","year":"2014","venue":"Proc. COMMA","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Thimm and Villata, 2017] M. Thimm and S. Villata. The first international competition on computational models of argumentation: Results and analysis. Artif. Intell., 252:267-294, 2017.","title":"The first international competition on computational models of argumentation: Results and analysis","authors":"M Thimm, S Villata","year":"2017","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Valiant and Vazirani, 1986] L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theor. Com- put. Sci., 47(3):85-93, 1986.","title":"NP is as easy as detecting unique solutions","authors":"L G Valiant, V V Vazirani","year":"1986","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}