{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:19:58Z","timestamp":1740158398367,"version":"3.37.3"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T00:00:00Z","timestamp":1526342400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P25607","Y698"],"award-info":[{"award-number":["P25607","Y698"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["K\u00fcnstl Intell"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s13218-018-0531-2","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T00:29:20Z","timestamp":1526344160000},"page":"191-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Programming on Tree Decompositions with D-FLAT"],"prefix":"10.1007","volume":"32","author":[{"given":"Michael","family":"Abseher","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2898-2830","authenticated-orcid":false,"given":"Bernhard","family":"Bliem","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Hecher","sequence":"additional","affiliation":[]},{"given":"Marius","family":"Moldovan","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,15]]},"reference":[{"key":"531_CR1","doi-asserted-by":"crossref","unstructured":"Abseher M, Bliem B, Charwat G, Dusberger F, Hecher M, Woltran S (2014) The D-FLAT system for dynamic programming on tree decompositions. In: Proceedings of the JELIA 2014, LNCS, vol 8761. Springer, pp 558\u2013572","DOI":"10.1007\/978-3-319-11558-0_39"},{"issue":"1","key":"531_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.3233\/FI-2016-1397","volume":"147","author":"B Bliem","year":"2016","unstructured":"Bliem B, Charwat G, Hecher M, Woltran S (2016) \n                    \n                      \n                    \n                    $$D{\\text{- }}FLAT^2$$\n                  : subset minimization in dynamic programming on tree decompositions made easy. Fundam Inform 147(1):27\u201361","journal-title":"Fundam Inform"},{"key":"531_CR3","unstructured":"Bliem B, Kaufmann B, Schaub T, Woltran S (2016) ASP for anytime dynamic programming on tree decompositions. In: Proceedings of IJCAI 2016. AAAI Press, pp 979\u2013986"},{"key":"531_CR4","unstructured":"Bliem B, Moldovan M, Woltran S (2017) The D-FLAT system: user manual. Technical report, DBAI-TR-2017-107, DBAI, TU Wien, Vienna, Austria"},{"issue":"4","key":"531_CR5","first-page":"1067","volume":"27","author":"B Bliem","year":"2017","unstructured":"Bliem B, Pichler R, Woltran S (2017) Implementing Courcelle\u2019s theorem in a declarative framework for dynamic programming. J Logic Comput 27(4):1067\u20131094","journal-title":"J Logic Comput"},{"key":"531_CR6","doi-asserted-by":"crossref","unstructured":"Niedermeier R (2006) Invitation to fixed-parameter algorithms. In: Oxford lecture series in mathematics and its applications, vol 31. Oxford University Press","DOI":"10.1093\/acprof:oso\/9780198566076.003.0001"},{"issue":"1","key":"531_CR7","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 PD (1984) Graph minors. III. Planar tree-width. J Combin Theory Ser B 36(1):49\u201364","journal-title":"J Combin Theory Ser B"}],"container-title":["KI - K\u00fcnstliche Intelligenz"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13218-018-0531-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-018-0531-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-018-0531-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T20:28:53Z","timestamp":1557865733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13218-018-0531-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,15]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["531"],"URL":"https:\/\/doi.org\/10.1007\/s13218-018-0531-2","relation":{},"ISSN":["0933-1875","1610-1987"],"issn-type":[{"type":"print","value":"0933-1875"},{"type":"electronic","value":"1610-1987"}],"subject":[],"published":{"date-parts":[[2018,5,15]]},"assertion":[{"value":"15 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}