{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:50:52Z","timestamp":1742950252251,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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_32","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"384-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Combining Heuristics for Configuration Problems Using Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ryabokon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gottfried","family":"Schenner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-21311-3_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M Aschinger","year":"2011","unstructured":"Aschinger, M., Drescher, C., Friedrich, G., Gottlob, G., Jeavons, P., Ryabokon, A., Thorstensen, E.: Optimization methods for the partner units problem. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 4\u201319. Springer, Heidelberg (2011)"},{"key":"32_CR2","unstructured":"Aschinger, M., Drescher, C., Gottlob, G., Jeavons, P., Thorstensen, E.: Tackling the partner units configuration problem. In: Proceedings of IJCAI, pp. 497\u2013503 (2011)"},{"issue":"2","key":"32_CR3","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. 24(2), 147\u2013164 (2011)","journal-title":"AI Commun."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Cipriano, R., Di Gaspero, L., Dovier, A.: A hybrid solver for large neighborhood search: mixing gecode and easylocal++. In: Hybrid Metaheuristics, pp. 141\u2013155 (2009)","DOI":"10.1007\/978-3-642-04918-7_11"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Friedrich, G., Ryabokon, A., Falkner, A.A., Haselb\u00f6ck, A., Schenner, G., Schreiner, H.: (Re) configuration based on model generation. In: LoCoCo Workshop, pp. 26\u201335 (2011)","DOI":"10.4204\/EPTCS.65.3"},{"key":"32_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"32_CR7","volume-title":"Answer Set Solving in Practice","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Morgan & Claypool Publishers, San Rafael (2012)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaufmann, B., Romero, J., Otero, R., Schaub, T., Wanko, P.: Domain-specific heuristics in answer set programming. In: Proceedings of AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8585"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Haselb\u00f6ck, A., Schenner, G.: S\u2019UPREME. In: Knowledge-Based Configuration: From Research to Business Cases, pp. 263\u2013269 (2014)","DOI":"10.1016\/B978-0-12-415817-7.00022-0"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Hotz, L., Felfernig, A., Stumptner, M., Ryabokon, A., Bagley, C., Wolter, K.: Configuration knowledge representation and reasoning. In: Knowledge-Based Configuration: From Research to Business Cases, pp. 41\u201372 (2014)","DOI":"10.1016\/B978-0-12-415817-7.00006-2"},{"key":"32_CR11","unstructured":"Madigan, C., Malik, S., Moskewicz, M., Zhang, L., Zhao, Y.: Chaff: engineering an efficient SAT solver. In: Proceedings of DAC (2001)"},{"key":"32_CR12","unstructured":"Mayer, W., Bettex, M., Stumptner, M., Falkner, A.: On solving complex rack configuration problems using CSP methods. In: Proceedings of the IJCAI Workshop on Configuration (2009)"},{"issue":"1","key":"32_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0004-3702(82)90021-2","volume":"19","author":"J McDermott","year":"1982","unstructured":"McDermott, J.: R1: a rule-based configurer of computer systems. Artif. Intell. 19(1), 39\u201388 (1982)","journal-title":"Artif. Intell."},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-40564-8_46","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"A Ryabokon","year":"2013","unstructured":"Ryabokon, A., Friedrich, G., Falkner, A.A.: Conflict-based program rewriting for solving configuration problems. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 465\u2013478. Springer, Heidelberg (2013)"},{"key":"32_CR15","unstructured":"Schenner, G., Falkner, A., Ryabokon, A., Friedrich, G.: Solving object-oriented configuration scenarios with ASP. In: Proceedings of the Configuration Workshop, pp. 55\u201362 (2013)"},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10601-012-9137-8","volume":"18","author":"T Schrijvers","year":"2013","unstructured":"Schrijvers, T., Tack, G., Wuille, P., Samulowitz, H., Stuckey, P.J.: Search combinators. Constraints 18(2), 269\u2013305 (2013)","journal-title":"Constraints"},{"issue":"1","key":"32_CR17","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/MIS.2007.6","volume":"22","author":"C Sinz","year":"2007","unstructured":"Sinz, C., Haag, A.: Configuration. IEEE Intell. Syst. 22(1), 78\u201390 (2007)","journal-title":"IEEE Intell. Syst."},{"key":"32_CR18","unstructured":"Soininen, T., Niemel\u00e4, I., Tiihonen, J., Sulonen, R.: Representing configuration knowledge with weight constraint rules. In: Proceedings of the Workshop on ASP, pp. 195\u2013201 (2001)"},{"issue":"2","key":"32_CR19","first-page":"111","volume":"10","author":"M Stumptner","year":"1997","unstructured":"Stumptner, M.: An overview of knowledge-based configuration. AI Commun. 10(2), 111\u2013125 (1997)","journal-title":"AI Commun."},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Teppan, E.C., Friedrich, G., Falkner, A.A.: QuickPup: a heuristic backtracking algorithm for the partner units configuration problem. In: Proceedings of IAAI, pp. 2329\u20132334 (2012)","DOI":"10.1609\/aaai.v26i2.18979"},{"issue":"1","key":"32_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.3233\/AIC-2012-0547","volume":"26","author":"J Tiihonen","year":"2013","unstructured":"Tiihonen, J., Heiskala, M., Anderson, A., Soininen, T.: WeCoTin - a practical logic-based sales configurator. AI Commun. 26(1), 99\u2013131 (2013)","journal-title":"AI Commun."},{"issue":"1","key":"32_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Global Optim. 37(1), 95\u2013111 (2007)","journal-title":"J. Global Optim."}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:27:59Z","timestamp":1676978879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_32","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"}}]}}