{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T12:40:34Z","timestamp":1692189634623},"reference-count":33,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"DOI":"10.1093\/logcom\/exv089","type":"journal-article","created":{"date-parts":[[2016,1,9]],"date-time":"2016-01-09T01:57:57Z","timestamp":1452304677000},"page":"exv089","source":"Crossref","is-referenced-by-count":0,"title":["Implementing Courcelle's Theorem in a declarative framework for dynamic programming"],"prefix":"10.1093","author":[{"given":"Bernhard","family":"Bliem","sequence":"first","affiliation":[]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2016,1,7]]},"reference":[{"key":"2016010817574824000_exv089v1.1","unstructured":"M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher and S. Woltran. D-FLAT: Progress report. Technical Report DBAI-TR-2014-86, Vienna University of Technology, 2014."},{"key":"2016010817574824000_exv089v1.2","doi-asserted-by":"crossref","unstructured":"Abseher M. Bliem B. Charwat G. Dusberger F. Hecher M. Woltran S. The D-FLAT system for dynamic programming on tree decompositions. In Proceedings of JELIA, pp. 558\u2013572, 2014.","DOI":"10.1007\/978-3-319-11558-0_39"},{"key":"2016010817574824000_exv089v1.3","unstructured":"Alviano M. Calimeri F. Faber W. Ianni G. Leone N. Function symbols in ASP: Overview and perspectives. In Nonmonotonic Reasoning \u2013 Essays Celebrating Its 30th Anniversary, pp. 1\u201324. College Publications, 2011."},{"key":"2016010817574824000_exv089v1.4","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068412000129"},{"key":"2016010817574824000_exv089v1.5","doi-asserted-by":"crossref","unstructured":"Bliem B. Pichler R. Woltran S. Declarative dynamic programming as an alternative realization of Courcelle's theorem. In Proceedings of IPEC, pp. 28\u201340, 2013.","DOI":"10.1007\/978-3-319-03898-8_4"},{"key":"2016010817574824000_exv089v1.6","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernetica"},{"key":"2016010817574824000_exv089v1.7","first-page":"1","article-title":"Discovering treewidth","volume-title":"Proceedings of SOFSEM","volume":"3381","author":"Bodlaender","year":"2005"},{"key":"2016010817574824000_exv089v1.8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","article-title":"Answer set programming at a glance","volume":"54","author":"Brewka","year":"2011","journal-title":"Communications of the ACM"},{"key":"2016010817574824000_exv089v1.9","first-page":"407","article-title":"Computable functions in ASP: theory and implementation","volume-title":"Proceedings of ICLP","volume":"5366","author":"Calimeri","year":"2008"},{"key":"2016010817574824000_exv089v1.10","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"2016010817574824000_exv089v1.11","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"2016010817574824000_exv089v1.12","doi-asserted-by":"crossref","unstructured":"B. Courcelle and I. Durand. Computations by fly-automata beyond monadic second-order logic. CoRR, abs\/1305.7120, 2013.","DOI":"10.1017\/CBO9780511977619"},{"key":"2016010817574824000_exv089v1.13","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":"2016010817574824000_exv089v1.14","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602222"},{"key":"2016010817574824000_exv089v1.15","unstructured":"Flum J. Grohe M. Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, 2006."},{"key":"2016010817574824000_exv089v1.16","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.01.007"},{"key":"2016010817574824000_exv089v1.17","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.2200\/S00457ED1V01Y201211AIM019"},{"key":"2016010817574824000_exv089v1.18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","article-title":"Potassco: the potsdam answer set solving collection","volume":"24","author":"Gebser","year":"2011","journal-title":"AI Communications"},{"key":"2016010817574824000_exv089v1.19","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00207-2"},{"key":"2016010817574824000_exv089v1.20","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"2016010817574824000_exv089v1.21","doi-asserted-by":"crossref","unstructured":"Gottlob G. Pichler R. Wei F. Monadic datalog over finite structures of bounded treewidth. ACM Transactions on Computational Logic, 12, 2010.","DOI":"10.1145\/1838552.1838555"},{"key":"2016010817574824000_exv089v1.22","doi-asserted-by":"publisher","DOI":"10.1142\/S012905410200128X"},{"key":"2016010817574824000_exv089v1.23","doi-asserted-by":"crossref","unstructured":"Kloks T. Treewidth: Computations and Approximations , Vol. 842 of LNCS. Springer, 1994.","DOI":"10.1007\/BFb0045375"},{"key":"2016010817574824000_exv089v1.24","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2011.06.001"},{"key":"2016010817574824000_exv089v1.25","first-page":"87","article-title":"Semantic trees in automated theorem proving","volume-title":"Machine Intelligence","volume":"4","author":"Kowalski","year":"1969"},{"key":"2016010817574824000_exv089v1.26","doi-asserted-by":"crossref","unstructured":"Langer A. Reidl F. Rossmanith P. Sikdar S. Evaluation of an MSO-solver. In Proceedings of ALENEX, pp. 55\u201363. SIAM \/ Omnipress, 2012.","DOI":"10.1137\/1.9781611972924.5"},{"key":"2016010817574824000_exv089v1.27","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.cosrev.2014.08.001","article-title":"Practical algorithms for MSO model-checking on tree-decomposable graphs","volume":"13-14","author":"Langer","year":"2014","journal-title":"Computer Science Review"},{"key":"2016010817574824000_exv089v1.28","first-page":"505","article-title":"Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory - (extended abstract)","volume-title":"Proceedings of TAMC","volume":"6648","author":"Langer","year":"2011"},{"key":"2016010817574824000_exv089v1.29","unstructured":"Lifschitz V. What is answer set programming? In Proceedings of AAAI, pp. 1594\u20131597. AAAI Press, 2008."},{"key":"2016010817574824000_exv089v1.30","doi-asserted-by":"crossref","unstructured":"Marek V. W. Truszczy\u0144ski M. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective, pp. 375\u2013398. Springer, 1999.","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"2016010817574824000_exv089v1.31","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"},{"key":"2016010817574824000_exv089v1.32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"2016010817574824000_exv089v1.33","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90013-3"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/27\/4\/1067\/17659880\/exv089.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T12:22:24Z","timestamp":1692188544000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exv089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,7]]},"references-count":33,"alternative-id":["10.1093\/logcom\/exv089"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/exv089","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,7]]}}}