{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:54:09Z","timestamp":1725864849878},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319460727"},{"type":"electronic","value":"9783319460734"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46073-4_1","type":"book-chapter","created":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T10:59:32Z","timestamp":1473245972000},"page":"3-16","source":"Crossref","is-referenced-by-count":0,"title":["Providing Built-In Counters in a Declarative Dynamic Programming Environment"],"prefix":"10.1007","author":[{"given":"Michael","family":"Abseher","sequence":"first","affiliation":[]},{"given":"Marius","family":"Moldovan","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,8]]},"reference":[{"key":"1_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)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1007\/978-3-319-11558-0_39","volume-title":"Logics in Artificial Intelligence","author":"M Abseher","year":"2014","unstructured":"Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., Woltran, S.: The D-FLAT system for dynamic programming on tree decompositions. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 558\u2013572. Springer, Heidelberg (2014)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Woltran, S.: Computing secure sets in graphs using answer set programming. J. Logic Comput. (2016). Accepted for publication","DOI":"10.1093\/logcom\/exv060"},{"key":"1_CR4","unstructured":"Abseher, M., Musliu, N., Woltran, S.: Improving the efficiency of dynamic programming on tree decompositions via machine learning. Technical report DBAI-TR-2016-94, TU Wien (2016). http:\/\/www.dbai.tuwien.ac.at\/research\/report\/dbai-tr-2016-94.pdf"},{"issue":"2","key":"1_CR5","doi-asserted-by":"crossref","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 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"1_CR6","unstructured":"Bliem, B., Kaufmann, B., Schaub, T., Woltran, S.: ASP for anytime dynamic programming on tree decompositions. In: Proceedings of the IJCAI (2016). Accepted for publication"},{"issue":"4\u20135","key":"1_CR7","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 12(4\u20135), 445\u2013464 (2012)","journal-title":"TPLP"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 8246, pp. 28\u201340. Springer, Heidelberg (2013)"},{"issue":"1\u20132","key":"1_CR9","first-page":"1","volume":"11","author":"L Hans","year":"1993","unstructured":"Hans, L.: Bodlaender.: a tourist guide through treewidth. Acta Cybern. 11(1\u20132), 1\u201322 (1993)","journal-title":"Acta Cybern."},{"issue":"6","key":"1_CR10","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1_CR11","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"HL Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Inf. Comput. 208(3), 259\u2013275 (2010)","journal-title":"Inf. Comput."},{"issue":"12","key":"1_CR12","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"},{"issue":"1","key":"1_CR13","doi-asserted-by":"crossref","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. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"1_CR14","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., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Heidelberg (2015)"},{"key":"1_CR15","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, Burlington (2003)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-88636-5_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. 5317, pp. 1\u201311. Springer, Heidelberg (2008)"},{"key":"1_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity. Monographs in Computer Science","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"1_CR18","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Lindauer, M., Ostrowski, M., Romero, J., Schaub, T., Thiele, S.: Potassco User Guide 2.0. (2015). https:\/\/sourceforge.net\/projects\/potassco\/files\/guide\/2.0\/guide-2.0.pdf"},{"key":"1_CR19","volume-title":"Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning","author":"M Gebser","year":"2012","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, San Rafael (2012)"},{"issue":"2","key":"1_CR20","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: the potsdam answer set solving collection. AI Commun. 24(2), 107\u2013124 (2011)","journal-title":"AI Commun."},{"issue":"3\/4","key":"1_CR21","doi-asserted-by":"crossref","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 Gener. Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"New Gener. Comput."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Lierler, Y.: On the relation of constraint answer set programming languages and algorithms. In: Proceedings of the AAAI, pp. 521\u2013527. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8127"},{"key":"1_CR23","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. OUP, Oxford (2006)"},{"issue":"4\u20135","key":"1_CR24","first-page":"485","volume":"12","author":"M Ostrowski","year":"2012","unstructured":"Ostrowski, M., Schaub, T.: ASP modulo CSP: the Clingcon system. TPLP 12(4\u20135), 485\u2013503 (2012)","journal-title":"TPLP"},{"issue":"1","key":"1_CR25","doi-asserted-by":"crossref","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 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","KI 2016: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46073-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T21:35:11Z","timestamp":1657229711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46073-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319460727","9783319460734"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46073-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}