{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:47:38Z","timestamp":1762102058238,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319616599"},{"type":"electronic","value":"9783319616605"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61660-5_13","type":"book-chapter","created":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T05:22:22Z","timestamp":1498540942000},"page":"132-145","source":"Crossref","is-referenced-by-count":14,"title":["Answer Set Solving with Bounded Treewidth Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8681-7470","authenticated-orcid":false,"given":"Johannes K.","family":"Fichte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0131-6771","authenticated-orcid":false,"given":"Markus","family":"Hecher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Morak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"unstructured":"Abseher, M., Dusberger, F., Musliu, N., Woltran, S.: Improving the efficiency of dynamic programming on tree decompositions via machine learning. In: IJCAI 2015 (2015)","key":"13_CR1"},{"issue":"3","key":"13_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H Bodlaender","year":"2008","unstructured":"Bodlaender, H., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"issue":"12","key":"13_CR3","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"unstructured":"Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: ASP-core-2 input language format (2013)","key":"13_CR4"},{"key":"13_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Heidelberg (2015)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-20895-9_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T Eiter","year":"2011","unstructured":"Eiter, T., Fink, M., Ianni, G., Krennwallner, T., Sch\u00fcller, P.: Pushing efficient evaluation of HEX programs by modular decomposition. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 93\u2013106. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-20895-9_10"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.artint.2014.12.001","volume":"220","author":"JK Fichte","year":"2015","unstructured":"Fichte, J.K., Szeider, S.: Backdoors to tractable answer-set programming. Artif. Intell. 220, 64\u2013103 (2015)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Hecher, M., Morak, M., Woltran, S.: Answer set solving with bounded treewidth revisited. CoRR, arXiv:1702.02890 (2017)","key":"13_CR8","DOI":"10.1007\/978-3-319-61660-5_13"},{"doi-asserted-by":"crossref","unstructured":"Jakl, M., Pichler, R., Woltran, S.: Answer-set programming with bounded treewidth. In: IJCAI 2009, vol. 2 (2009)","key":"13_CR9","DOI":"10.1007\/978-3-642-04238-6_22"},{"issue":"2","key":"13_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1017\/S1471068412000099","volume":"14","author":"R Pichler","year":"2014","unstructured":"Pichler, R., R\u00fcmmele, S., Szeider, S., Woltran, S.: Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Theory Pract. Log. Program. 14(2), 141\u2013164 (2014)","journal-title":"Theory Pract. Log. Program."},{"issue":"1","key":"13_CR11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.jda.2009.06.002","volume":"8","author":"M Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithms 8(1), 50\u201364 (2010)","journal-title":"J. Discrete Algorithms"},{"unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H.A., Pitassi, T.: Combining component caching and clause learning for effective model counting. In: SAT 2004 (2004)","key":"13_CR12"},{"unstructured":"Syrj\u00e4nen, T.: Lparse 1.0 user\u2019s manual (2002). tcs.hut.fi\/Software\/smodels\/lparse.ps","key":"13_CR13"},{"doi-asserted-by":"crossref","unstructured":"Thurley, M.: sharpSAT - counting models with advanced component caching and implicit BCP. In: SAT 2006 (2006)","key":"13_CR14","DOI":"10.1007\/11814948_38"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61660-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T01:37:06Z","timestamp":1569548226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61660-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319616599","9783319616605"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61660-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}