{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:42:28Z","timestamp":1725896548251},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344121"},{"type":"electronic","value":"9783642344138"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_10","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:58:57Z","timestamp":1349071137000},"page":"130-144","source":"Crossref","is-referenced-by-count":2,"title":["Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Michael","family":"Morak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nysret","family":"Musliu","sequence":"additional","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":"10_CR1","first-page":"37","volume":"6","author":"D.W. Aha","year":"1991","unstructured":"Aha, D.W., Kibler, D.F., Albert, M.K.: Instance-based learning algorithms. Machine Learning\u00a06, 37\u201366 (1991)","journal-title":"Machine Learning"},{"key":"10_CR2","doi-asserted-by":"publisher","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. Alg. Disc. Meth.\u00a08, 277\u2013284 (1987)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/11775096_24","volume-title":"Algorithmic Aspects in Information and Management","author":"E.H. Bachoore","year":"2006","unstructured":"Bachoore, E.H., Bodlaender, H.L.: A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 255\u2013266. Springer, Heidelberg (2006)"},{"issue":"2","key":"10_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.3233\/AIC-2011-0493","volume":"24","author":"M. Balduccini","year":"2011","unstructured":"Balduccini, M.: Learning and using domain-specific heuristics in ASP solvers. AI Commun.\u00a024(2), 147\u2013164 (2011)","journal-title":"AI Commun."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01530761","volume":"12","author":"R. Ben-Eliyahu","year":"1994","unstructured":"Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Ann. Math. Artif. Intell.\u00a012, 53\u201387 (1994)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1-2","key":"10_CR6","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern.\u00a011(1-2), 1\u201322 (1993)","journal-title":"Acta Cybern."},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"H.L. Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper Bounds. Inf. Comput.\u00a0208(3), 259\u2013275 (2010)","journal-title":"Upper Bounds. Inf. Comput."},{"key":"10_CR8","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., 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":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-20895-9_40","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., Ziller, S.: A Portfolio Solver for Answer Set Programming: Preliminary Report. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol.\u00a06645, pp. 352\u2013357. Springer, Heidelberg (2011)"},{"issue":"3\/4","key":"10_CR10","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":"10_CR11","unstructured":"Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proc. UAI 2004, pp. 201\u2013208. AUAI Press (2004)"},{"key":"10_CR12","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 (2006)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M. Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: an update. SIGKDD Explorations\u00a011(1), 10\u201318 (2009)","journal-title":"SIGKDD Explorations"},{"key":"10_CR14","unstructured":"Hall, M.A., Smith, L.A.: Practical feature subset selection for machine learning. In: Proc. ACSC 1998, pp. 181\u2013191. Springer (1998)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Jakl, M., Pichler, R., Woltran, S.: Answer-set programming with bounded treewidth. In: Proc. IJCAI 2009, pp. 816\u2013822. AAAI Press (2009)","DOI":"10.1007\/978-3-642-04238-6_22"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth, computations and approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth, computations and approximations. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/net.10046","volume":"40","author":"A. Koster","year":"2002","unstructured":"Koster, A., van Hoesel, S., Kolen, A.: Solving partial constraint satisfaction problems with tree-decomposition. Networks\u00a040(3), 170\u2013180 (2002)","journal-title":"Networks"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S. Lauritzen","year":"1988","unstructured":"Lauritzen, S., Spiegelhalter, D.: Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B\u00a050, 157\u2013224 (1988)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"issue":"3","key":"10_CR19","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":"10_CR20","doi-asserted-by":"crossref","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 (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Morak, M., Musliu, N., Pichler, R., R\u00fcmmele, S., Woltran, S.: A new tree-decomposition based algorithm for answer set programming. In: Proc. ICTAI, pp. 916\u2013918 (2011)","DOI":"10.1109\/ICTAI.2011.154"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-15675-5_34","volume-title":"Logics in Artificial Intelligence","author":"M. Morak","year":"2010","unstructured":"Morak, M., Pichler, R., R\u00fcmmele, S., Woltran, S.: A Dynamic-Programming Based ASP-Solver. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS, vol.\u00a06341, pp. 369\u2013372. Springer, Heidelberg (2010)"},{"issue":"3-4","key":"10_CR23","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."},{"key":"10_CR24","unstructured":"Quinlan, R.J.: Learning with continuous classes. In: 5th Australian Joint Conference on Artificial Intelligence, Singapore, pp. 343\u2013348 (1992)"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II: Algorithmic aspects of tree-width. Journal Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal Algorithms"},{"issue":"1","key":"10_CR26","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jda.2009.06.002","volume":"8","author":"M. Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithms\u00a08(1), 50\u201364 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR27","unstructured":"Shoikhet, K., Geiger, D.: A practical algorithm for finding optimal triangulations. In: Proc. AAAI 1997, pp. 185\u2013190. AAAI Press\/The MIT Press (1997)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv.\u00a041(1) (2008)","DOI":"10.1145\/1456650.1456656"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear-time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput.\u00a013, 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"key":"10_CR30","unstructured":"Wang, Y., Witten, I.H.: Induction of model trees for predicting continuous classes. In: Poster Papers of the 9th European Conference on Machine Learning (1997)"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-24599-5_17","volume-title":"Logic Programming","author":"Y. Zhao","year":"2003","unstructured":"Zhao, Y., Lin, F.: Answer Set Programming Phase Transition: A Study on Randomly Generated Programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 239\u2013253. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34413-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T22:49:51Z","timestamp":1714430991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}