{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:09:20Z","timestamp":1748664560120,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232638"},{"type":"electronic","value":"9783319232645"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23264-5_19","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"213-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams"],"prefix":"10.1007","author":[{"given":"G\u00fcnther","family":"Charwat","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"19_CR1","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. Algebraic Discrete Methods 8, 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/s004530010025","volume":"27","author":"B Aspvall","year":"2000","unstructured":"Aspvall, B., Telle, J.A., Proskurowski, A.: Memory requirements for table computations in partial k-tree algorithms. Algorithmica 27(3), 382\u2013394 (2000)","journal-title":"Algorithmica"},{"issue":"2\u20133","key":"19_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1008699807402","volume":"10","author":"R Bahar","year":"1997","unstructured":"Bahar, R., Frohm, E., Gaona, C., Hachtel, G., Macii, E., Pardo, A., Somenzi, F.: Algebric decision diagrams and their applications. Formal Meth. Syst. Des. 10(2\u20133), 171\u2013206 (1997)","journal-title":"Formal Meth. Syst. Des."},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.disopt.2006.05.008","volume":"3","author":"N Betzler","year":"2006","unstructured":"Betzler, N., Niedermeier, R., Uhlmann, J.: Tree decompositions of graphs: saving memory in dynamic programming. Discrete Optim. 3(3), 220\u2013229 (2006)","journal-title":"Discrete Optim."},{"issue":"5","key":"19_CR5","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10009-014-0334-1","volume":"16","author":"D Beyer","year":"2014","unstructured":"Beyer, D., Stahlbauer, A.: BDD-based software verification - applications to event-condition-action systems. STTT 16(5), 507\u2013518 (2014)","journal-title":"STTT"},{"issue":"4\u20135","key":"19_CR6","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"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","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":"Upper Bounds. Inf. Comput."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Boutaleb, K., J\u00e9gou, P., Terrioux, C.: (No)good recording and ROBDDs for solving structured (V)CSPs. In: Proceedings of the ICTAI, pp. 297\u2013304. IEEE Computer Society (2006)","DOI":"10.1109\/ICTAI.2006.1"},{"issue":"8","key":"19_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"100","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 100(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"19_CR10","unstructured":"Charwat, G., Dvo\u0159\u00e1k, W.: dynPARTIX 2.0 - Dynamic programming argumentation reasoning tool. In: Proceedings of the COMMA, FAIA, vol. 245, pp. 507\u2013508. IOS Press (2012)"},{"key":"19_CR11","unstructured":"Chavira, M., Darwiche, A.: Compiling Bayesian networks using variable elimination. In: Proceedings of the IJCAI, pp. 2443\u20132449 (2007)"},{"issue":"1","key":"19_CR12","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. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"19_CR13","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science (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. 5317, pp. 1\u201311. Springer, Heidelberg (2008)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.entcs.2013.07.009","volume":"296","author":"T van Dijk","year":"2013","unstructured":"van Dijk, T., Laarman, A., van de Pol, J.: Multi-core BDD operations for symbolic reachability. Electr. Notes Theor. Comput. Sci. 296, 127\u2013143 (2013)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321\u2013357 (1995)","journal-title":"Artif. Intell."},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2012.03.005","volume":"186","author":"W Dvo\u0159\u00e1k","year":"2012","unstructured":"Dvo\u0159\u00e1k, W., Pichler, R., Woltran, S.: Towards fixed-parameter tractable algorithms for abstract argumentation. Artif. Intell. 186, 1\u201337 (2012)","journal-title":"Artif. Intell."},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. I. Publicationes Mathematicae (Debrecen) 6, 290\u2013297 (1959)","journal-title":"I. Publicationes Mathematicae (Debrecen)"},{"key":"19_CR19","unstructured":"Fargier, H., Marquis, P.: Knowledge compilation properties of Trees-of-BDDs, revisited. In: Proceedings of the IJCAI, pp. 772\u2013777 (2009)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Friedman, S.J., Supowit, K.J.: Finding the optimal variable ordering for binary decision diagrams. In: Proceedings of the IEEE Design Automation Conference, pp. 348\u2013356. ACM (1987)","DOI":"10.1145\/37888.37941"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Gro\u00ebr, C., Sullivan, B.D., Weerapurage, D.: INDDGO: Integrated network decomposition & dynamic programming for graph optimization. Technical reports ORNL\/TM-2012\/176 (2012)","DOI":"10.2172\/1055043"},{"key":"19_CR22","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1613\/jair.4586","volume":"51","author":"P Kissmann","year":"2014","unstructured":"Kissmann, P., Hoffmann, J.: BDD ordering heuristics for classical planning. J. Artif. Intell. Res. (JAIR) 51, 779\u2013804 (2014)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"19_CR23","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. 842. Springer, Heidelberg (1994)"},{"issue":"4","key":"19_CR24","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 - A game-theoretic approach. Discrete Optimization 8(4), 568\u2013594 (2011)","journal-title":"Discrete Optimization"},{"key":"19_CR25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/1.9781611972924.5","volume-title":"2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Alexander Langer","year":"2012","unstructured":"Langer, A., Reidl, F., Rossmanith, P., Sikdar, S.: Evaluation of an MSO-solver. In: Proceedings of the ALENEX, pp. 55\u201363 (2012)"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-319-10431-7_4","volume-title":"Software Engineering and Formal Methods","author":"A Lovato","year":"2014","unstructured":"Lovato, A., Macedonio, D., Spoto, F.: A thread-safe library for binary decision diagrams. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 35\u201349. Springer, Heidelberg (2014)"},{"issue":"4","key":"19_CR27","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/s10458-013-9232-2","volume":"28","author":"A M\u0229ski","year":"2014","unstructured":"M\u0229ski, A., Penczek, W., Szreter, M., Woi\u017ana-Szcze\u015bniak, B., Zbrzezny, A.: BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance. Auton. Agent. Multi-Agent Syst. 28(4), 558\u2013604 (2014)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Miller, D.M.: Multiple-valued logic design tools. In: Proceedings of the MVL, pp. 2\u201311 (1993)","DOI":"10.1109\/ISMVL.1993.289589"},{"key":"19_CR29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1093\/acprof:oso\/9780198566076.003.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"Rolf Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. OUP, Oxford (2006)"},{"issue":"1","key":"19_CR30","doi-asserted-by":"publisher","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"},{"key":"19_CR31","unstructured":"Sachenbacher, M., Williams, B.C.: Bounded search and symbolic inference for constraint optimization. In: Proceedings of the IJCAI, pp. 286\u2013291. PBC (2005)"},{"key":"19_CR32","unstructured":"Somenzi, F.: CU Decision Diagram package release 2.5.0. Department of Electrical and Computer Engineering, University of Colorado at Boulder (2012)"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/11493853_26","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S Subbarayan","year":"2005","unstructured":"Subbarayan, S.: Integrating CSP decomposition techniques and BDDs for compiling configuration problems. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 351\u2013365. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23264-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T16:22:11Z","timestamp":1748622131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}