{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:01:22Z","timestamp":1768453282919,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319115573","type":"print"},{"value":"9783319115580","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11558-0_39","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"558-572","source":"Crossref","is-referenced-by-count":8,"title":["The D-FLAT System for Dynamic Programming on Tree Decompositions"],"prefix":"10.1007","author":[{"given":"Michael","family":"Abseher","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Bliem","sequence":"additional","affiliation":[]},{"given":"G\u00fcnther","family":"Charwat","sequence":"additional","affiliation":[]},{"given":"Frederico","family":"Dusberger","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Hecher","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., Woltran, S.: D-FLAT: Progress report. Technical Report DBAI-TR-2014-86, Vienna University of Technology (2014)"},{"issue":"2","key":"39_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods\u00a08(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"39_CR3","unstructured":"Aschinger, M., Drescher, C., Gottlob, G., Jeavons, P., Thorstensen, E.: Structural decomposition methods and what they are good for. In: Proc. STACS. LIPIcs, vol.\u00a09, pp. 12\u201328. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"issue":"4-5","key":"39_CR4","first-page":"445","volume":"12","author":"B. Bliem","year":"2012","unstructured":"Bliem, B., Morak, M., Woltran, S.: D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. TPLP\u00a012(4-5), 445\u2013464 (2012)","journal-title":"TPLP"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-03898-8_4","volume-title":"Parameterized and Exact Computation","author":"B. Bliem","year":"2013","unstructured":"Bliem, B., Pichler, R., Woltran, S.: Declarative dynamic programming as an alternative realization of courcelle\u2019s theorem. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol.\u00a08246, pp. 28\u201340. Springer, Heidelberg (2013)"},{"issue":"1-2","key":"39_CR6","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern.\u00a011(1-2), 1\u201322 (1993)","journal-title":"Acta Cybern."},{"issue":"6","key":"39_CR7","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 1\u201316. Springer, Heidelberg (2005)"},{"issue":"3","key":"39_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J.\u00a051(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"issue":"3","key":"39_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"H.L. Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Inf. Comput.\u00a0208(3), 259\u2013275 (2010)","journal-title":"Inf. Comput."},{"issue":"12","key":"39_CR11","doi-asserted-by":"publisher","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\u00a054(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"39_CR13","series-title":"Lecture Notes in Artificial Intelligence","first-page":"1","volume-title":"MICAI 2008: Advances in Artificial Intelligence","author":"A. Dermaku","year":"2008","unstructured":"Dermaku, A., Ganzow, T., Gottlob, G., McMahan, B., Musliu, N., Samer, M.: Heuristic methods for hypertree decomposition. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol.\u00a05317, pp. 1\u201311. Springer, Heidelberg (2008)"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"39_CR15","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A user\u2019s guide to gringo, clasp, clingo, and iclingo. Preliminary Draft (2010), \n                      http:\/\/potassco.sourceforge.net"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers (2012)","DOI":"10.1007\/978-3-031-01561-8"},{"issue":"1-2","key":"39_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0004-3702(02)00207-2","volume":"138","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M., Leone, N.: Logic programming and knowledge representation \u2013 the A-Prolog perspective. Artif. Intell.\u00a0138(1-2), 3\u201338 (2002)","journal-title":"Artif. Intell."},{"issue":"3\/4","key":"39_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Comput.\u00a09(3\/4), 365\u2013386 (1991)","journal-title":"New Generation Comput."},{"issue":"3","key":"39_CR19","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. J. Comput. Syst. Sci.\u00a064(3), 579\u2013627 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1","key":"39_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory, Ser. B\u00a036(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11558-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:11:29Z","timestamp":1676891489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}