{"type":"ScholarlyArticle","title":"The Impact of Treewidth on ASP Grounding and Solving","authors":[{"name":"Bernhard Bliem","slug":"bernhard-bliem","given":"Bernhard","family":"Bliem","affiliation":"TU Wien , Vienna , Austria"},{"name":"Marius Moldovan","slug":"marius-moldovan","given":"Marius","family":"Moldovan","affiliation":"TU Wien , Vienna , Austria"},{"name":"Michael Morak","slug":"michael-morak","given":"Michael","family":"Morak","affiliation":"TU Wien , Vienna , Austria"},{"name":"Stefan Woltran","slug":"stefan-woltran","given":"Stefan","family":"Woltran","affiliation":"TU Wien , Vienna , Austria"}],"abstract":"In this paper, we aim to study how the performance of modern answer set programming (ASP) solvers is influenced by the treewidth of the input program and to investigate the consequences of this relationship. We first perform an experimental evaluation that shows that the solving performance is heavily influenced by the treewidth, given ground input programs that are otherwise uniform, both in size and construction. This observation leads to an important question for ASP, namely, how to design encodings such that the treewidth of the resulting ground program remains small. To this end, we define the class of connection-guarded programs, which guarantees that the treewidth of the program after grounding only depends on the treewidth (and the degree) of the input instance. In order to obtain this result, we formalize the grounding process using MSO transductions.","doi":"10.24963/ijcai.2017/118","url":"https://ijcai.org/proceedings/2017/118","pdf":"https://ijcai.org/proceedings/2017/0118.pdf","markdown":"https://ijcai.org/proceedings/2017/118.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/118","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":118,"pages":{"first":852,"last":858},"keywords":["Knowledge Representation, Reasoning, and Logic: Automated Reasoning and Theorem Proving","Knowledge Representation, Reasoning, and Logic: Non-monotonic Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Alviano et al., 2015] Mario Alviano, Carmine Dodaro, Nicola Leone, and Francesco Ricca. Advances in WASP. In Proc. LPNMR, pages 40-54, 2015.","title":"Advances in WASP","authors":"Mario Alviano, Carmine Dodaro, Nicola Leone, Francesco Ricca","year":"2015","venue":"Proc. LPNMR","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Atserias et al., 2011] Albert Atserias, Johannes K. Fichte, and Marc Thurley. Clause-learning algorithms with many restarts and bounded-width resolution. J. Artif. Intell. Res. (JAIR), 40:353-373, 2011.","title":"Clause-learning algorithms with many restarts and bounded-width resolution","authors":"Albert Atserias, Johannes K Fichte, Marc Thurley","year":"2011","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Brewka et al., 2011] Gerhard Brewka, Thomas Eiter, and Miroslaw Truszczynski. Answer set programming at a glance. Commun. ACM, 54(12):92-103, 2011.","title":"Answer set programming at a glance","authors":"Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski","year":"2011","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Calimeri et al., 2015] Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kamin- ski, Thomas Krennwallner, Nicola Leone, Francesco Ricca, and Torsten Schaub. ASP-core-2 input lan- guage format. https://www.mat.unical.it/ aspcomp2013/ASPStandardization, 2015.","title":"ASP-core-2 input language format","authors":"Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Francesco Ricca, Torsten Schaub","year":"2015","venue":null,"doi":null,"url":"https://www.mat.unical.it/aspcomp2013/ASPStandardization","internal_url":null},{"position":5,"raw":"[Cȃlinescu et al., 2003] Gruia Cȃlinescu, Cristina G. Fernan- des, and Bruce A. Reed. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree- width. J. Algorithms, 48(2):333-359, 2003.","title":"Multicuts in unweighted graphs and digraphs with bounded degree and bounded treewidth","authors":"Gruia Cȃlinescu, Cristina G Fernandes, Bruce A Reed","year":"2003","venue":"J. Algorithms","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Courcelle and Engelfriet, 2012] Bruno Courcelle and Joost Engelfriet. Graph Structure and Monadic Second-Order Logic -A Language-Theoretic Approach, volume 138 of Encyclopedia of mathematics and its applications. Cam- bridge University Press, 2012.","title":"Graph Structure and Monadic Second-Order Logic -A Language-Theoretic Approach","authors":"Engelfriet Courcelle, Bruno Courcelle, Joost Engelfriet","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Courcelle and Olariu, 2000] Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs. Discr. Appl. Math., 101(1-3):77-114, 2000.","title":"Upper bounds to the clique width of graphs","authors":"Olariu Courcelle, Bruno Courcelle, Stephan Olariu","year":"2000","venue":"Discr. Appl. Math","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dantsin et al., 2001] Evgeny Dantsin, Thomas Eiter, Georg Gottlob, and Andrei Voronkov. Complexity and expres- sive power of logic programming. ACM Comput. Surv., 33(3):374-425, 2001.","title":"Complexity and expressive power of logic programming","authors":"Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov","year":"2001","venue":"ACM Comput. Surv","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Eiter and Gottlob, 1995] Thomas Eiter and Georg Gottlob. On the computational cost of disjunctive logic program- ming: Propositional case. Ann. Math. Artif. Intell., 15(3- 4):289-323, 1995.","title":"On the computational cost of disjunctive logic programming: Propositional case","authors":"Thomas Eiter, Georg Gottlob","year":"1995","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Elkabani et al., 2005] Islam Elkabani, Enrico Pontelli, and Tran Cao Son. Smodels a -A system for computing answer sets of logic programs with aggregates. In Proc. LPNMR, pages 427-431, 2005.","title":"Son. Smodels a -A system for computing answer sets of logic programs with aggregates","authors":"Elkabani","year":"2005","venue":"Proc. LPNMR","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Fichte and Szeider, 2015] Johannes K. Fichte and Stefan Szeider. Backdoors to tractable answer set programming. Artif. Intell., 220:64-103, 2015.","title":"Backdoors to tractable answer set programming","authors":"Johannes K Fichte, Stefan Szeider","year":"2015","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fichte et al., 2017] Johannes K. Fichte, Markus Hecher, Michael Morak, and Stefan Woltran. Answer set solving with bounded treewidth revisited. In Proc. LPNMR, 2017. To appear.","title":"Answer set solving with bounded treewidth revisited","authors":"Johannes K Fichte, Markus Hecher, Michael Morak, Stefan Woltran","year":"2017","venue":"Proc. LPNMR","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gebser et al., 2011] Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Thomas Schneider. Potassco: The Potsdam an- swer set solving collection. AI Commun., 24(2):107-124, 2011.","title":"Potassco: The Potsdam answer set solving collection","authors":"Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, Marius Thomas Schneider","year":"2011","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gebser et al., 2012a] Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. Answer Set Solving in Practice. Morgan & Claypool, 2012.","title":"Answer Set Solving in Practice","authors":"Gebser","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gebser et al., 2012b] Martin Gebser, Benjamin Kaufmann, and Torsten Schaub. Conflict-driven answer set solving: From theory to practice. Artif. Intell., 187:52-89, 2012.","title":"Conflict-driven answer set solving: From theory to practice","authors":"Gebser","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gelfond and Lifschitz, 1988] Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proc. ICLP, pages 1070-1080, 1988.","title":"The stable model semantics for logic programming","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1988","venue":"Proc. ICLP","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gottlob et al., 2010] Georg Gottlob, Reinhard Pichler, and Fang Wei. Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell., 174(1):105-132, 2010.","title":"Bounded treewidth as a key to tractability of knowledge representation and reasoning","authors":"Gottlob","year":"2010","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Jakl et al., 2009] Michael Jakl, Reinhard Pichler, and Ste- fan Woltran. Answer-set programming with bounded treewidth. In Proc. IJCAI, pages 816-822, 2009.","title":"Answer-set programming with bounded treewidth","authors":"Michael Jakl, Reinhard Pichler, Stefan Woltran","year":"2009","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2009/140"},{"position":19,"raw":"[Leone et al., 2006] Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello. The DLV system for knowledge rep- resentation and reasoning. ACM Trans. Comput. Log., 7(3):499-562, 2006.","title":"The DLV system for knowledge representation and reasoning","authors":"Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello","year":"2006","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Marek and Truszczyński, 1999] Victor W. Marek and Mirosław Truszczyński. Stable models -an alternative logic programming paradigm. In The Logic Program- ming Paradigm: A 25-Year Perspective, pages 375-398. Springer, 1999.","title":"Stable models -an alternative logic programming paradigm","authors":"W Victor, Mirosław Marek, Truszczyński","year":"1999","venue":"The Logic Programming Paradigm: A 25-Year Perspective","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Pichler et al., 2014] Reinhard Pichler, Stefan Rümmele, Stefan Szeider, and Stefan Woltran. Tractable answer-set programming with weight constraints: bounded treewidth is not enough. TPLP, 14(2):141-164, 2014.","title":"Tractable answer-set programming with weight constraints: bounded treewidth is not enough","authors":"Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran","year":"2014","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Selman et al., 1996] Bart Selman, David G. Mitchell, and Hector J. Levesque. Generating hard satisfiability prob- lems. Artif. Intell., 81(1-2):17-29, 1996.","title":"Generating hard satisfiability problems","authors":"Bart Selman, David G Mitchell, Hector J Levesque","year":"1996","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Szeider, 2003] Stefan Szeider. On fixed-parameter tractable parameterizations of SAT. In Proc. SAT, pages 188-202, 2003.","title":"On fixed-parameter tractable parameterizations of SAT","authors":"Stefan Szeider","year":"2003","venue":"Proc. SAT","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Truszczyński, 2011] Mirosław Truszczyński. Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs. TPLP, 11(6):881-904, 2011.","title":"Mirosław Truszczyński. Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs","authors":"Truszczyński","year":"2011","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Tseitin, 1983] Grigori S Tseitin. On the complexity of derivation in propositional calculus. In Automation of Rea- soning, pages 466-483. Springer, 1983.","title":"On the complexity of derivation in propositional calculus","authors":"Grigori S Tseitin","year":"1983","venue":"Automation of Reasoning","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Urquhart, 1987] Alasdair Urquhart. Hard examples for res- olution. JACM, 34(1):209-219, 1987.","title":"Alasdair Urquhart. Hard examples for resolution","authors":"Urquhart","year":"1987","venue":"JACM","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Wen et al., 2016] Lian Wen, Kewen Wang, Yi-Dong Shen, and Fangzhen Lin. A model for phase transition of ran- dom answer-set programs. ACM Trans. Comput. Log., 17(3):22:1-22:34, 2016.","title":"A model for phase transition of random answer-set programs","authors":"Lian Wen, Kewen Wang, Yi-Dong Shen, Fangzhen Lin","year":"2016","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Zhao and Lin, 2003] Yuting Zhao and Fangzhen Lin. An- swer set programming phase transition: A study on ran- domly generated programs. In Proc. ICLP, pages 239- 253, 2003.","title":"Answer set programming phase transition: A study on randomly generated programs","authors":"Lin ; ] Yuting Zhao, Fangzhen Zhao, Lin","year":"2003","venue":"Proc. ICLP","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}