{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:08:10Z","timestamp":1725757690116},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038971"},{"type":"electronic","value":"9783319038988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03898-8_4","type":"book-chapter","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T02:57:26Z","timestamp":1384829846000},"page":"28-40","source":"Crossref","is-referenced-by-count":4,"title":["Declarative Dynamic Programming as an Alternative Realization of Courcelle\u2019s Theorem"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Bliem","sequence":"first","affiliation":[]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput.\u00a085(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Langer, A., Reidl, F., Rossmanith, P., Sikdar, S.: Practical algorithms for MSO model-checking on tree-decomposable graphs (2013), http:\/\/tcs.rwth-aachen.de\/~sikdar\/index_files\/article.pdf","DOI":"10.1016\/j.cosrev.2014.08.001"},{"key":"4_CR3","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":"6","key":"4_CR4","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1145\/602220.602222","volume":"49","author":"J. Flum","year":"2002","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. J. ACM\u00a049(6), 716\u2013752 (2002)","journal-title":"J. ACM"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S012905410200128X","volume":"13","author":"N. Klarlund","year":"2002","unstructured":"Klarlund, N., M\u00f8ller, A., Schwartzbach, M.I.: MONA implementation secrets. Int. J. Found. Comput. Sci.\u00a013(4), 571\u2013586 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.disopt.2011.06.001","volume":"8","author":"J. Kneis","year":"2011","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: Courcelle\u2019s theorem \u2013 a game-theoretic approach. Discrete Optimization\u00a08(4), 568\u2013594 (2011)","journal-title":"Discrete Optimization"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Langer, A., Reidl, F., Rossmanith, P., Sikdar, S.: Evaluation of an MSO-solver. In: Proc. ALENEX, pp. 55\u201363. SIAM \/ Omnipress (2012)","DOI":"10.1137\/1.9781611972924.5"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Durand, I.: Computations by fly-automata beyond monadic second-order logic. CoRR abs\/1305.7120 (2013)","DOI":"10.1017\/CBO9780511977619"},{"issue":"12","key":"4_CR9","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":"4-5","key":"4_CR10","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":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-20877-5_49","volume-title":"Theory and Applications of Models of Computation","author":"A. Langer","year":"2011","unstructured":"Langer, A., Rossmanith, P., Sikdar, S.: Linear-time algorithms for graphs of bounded rankwidth: A fresh look using game theory - (extended abstract). In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol.\u00a06648, pp. 505\u2013516. Springer, Heidelberg (2011)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"issue":"3\/4","key":"4_CR13","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."},{"key":"4_CR14","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), http:\/\/potassco.sourceforge.net"},{"key":"4_CR15","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"},{"issue":"1-3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.apal.2004.01.007","volume":"130","author":"M. Frick","year":"2004","unstructured":"Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic\u00a0130(1-3), 3\u201331 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Monadic datalog over finite structures of bounded treewidth. ACM Trans. Comput. Log.\u00a012(1) (2010)","DOI":"10.1145\/1838552.1838555"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03898-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T18:09:47Z","timestamp":1688666987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03898-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038971","9783319038988"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03898-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}