{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:56Z","timestamp":1725565436710},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156748"},{"type":"electronic","value":"9783642156755"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15675-5_34","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T04:07:17Z","timestamp":1284350837000},"page":"369-372","source":"Crossref","is-referenced-by-count":2,"title":["A Dynamic-Programming Based ASP-Solver"],"prefix":"10.1007","author":[{"given":"Michael","family":"Morak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"R\u00fcmmele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-04238-6_75","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Denecker","year":"2009","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczynski, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 637\u2013654. Springer, Heidelberg (2009)"},{"key":"34_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","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.J., 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":"34_CR3","first-page":"250","volume-title":"Proc. AAAI 2006","author":"G. Gottlob","year":"2006","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. In: Proc. AAAI 2006, pp. 250\u2013256. AAAI Press, Menlo Park (2006)"},{"key":"34_CR4","first-page":"816","volume-title":"Proc. IJCAI 2009","author":"M. Jakl","year":"2009","unstructured":"Jakl, M., Pichler, R., Woltran, S.: Answer-set programming with bounded treewidth. In: Proc. IJCAI 2009, pp. 816\u2013822. AAAI Press, Menlo Park (2009)"},{"issue":"3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Log.\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm \u2013 A 25-Year Perspective","author":"V.W. Marek","year":"1999","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm \u2013 A 25-Year Perspective, pp. 375\u2013398. Springer, Heidelberg (1999)"},{"issue":"3-4","key":"34_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell.\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"unstructured":"Pichler, R., R\u00fcmmele, S., Szeider, S., Woltran, S.: Tractable answer-set programming with weight constraints: Bounded treewidth is not enough. In: Proc. KR 2010, pp. 508\u2013517. AAAI Press, Menlo Park (2010)","key":"34_CR8"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15675-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:45:12Z","timestamp":1553075112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15675-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156748","9783642156755"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15675-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}