iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1145/3468264.3468566
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:15:35Z","timestamp":1725682535529},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","funder":[{"name":"Science and Technology Innovation 2030 The New Generation of Artificial Intelligence","award":["2018AAA0100901"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,20]]},"DOI":"10.1145\/3468264.3468566","type":"proceedings-article","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T21:40:03Z","timestamp":1629322803000},"page":"956-967","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Generating efficient solvers from constraint models"],"prefix":"10.1145","author":[{"given":"Shu","family":"Lin","sequence":"first","affiliation":[{"name":"Peking University, China"}]},{"given":"Na","family":"Meng","sequence":"additional","affiliation":[{"name":"Virginia Tech, USA"}]},{"given":"Wenxin","family":"Li","sequence":"additional","affiliation":[{"name":"Peking University, China"}]}],"member":"320","published-online":{"date-parts":[[2021,8,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/WICSA.2011.37"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227151"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17458-2_7"},{"key":"e_1_3_2_1_4_1","unstructured":"Nikolaj Bj\u00f8rner Leonardo de Moura Lev Nachmanson and Christoph Wintersteiger. 2021. Programming Z3. http:\/\/theory.stanford.edu\/ nikolaj\/programmingz3.html Nikolaj Bj\u00f8rner Leonardo de Moura Lev Nachmanson and Christoph Wintersteiger. 2021. Programming Z3. http:\/\/theory.stanford.edu\/ nikolaj\/programmingz3.html"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14186-7_25"},{"key":"e_1_3_2_1_6_1","unstructured":"2020. Choco-solver. https:\/\/choco-solver.org\/ 2020. Choco-solver. https:\/\/choco-solver.org\/"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13520-0_10"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-011-9112-9"},{"volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","key":"e_1_3_2_1_9_1","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms , third edition. MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, third edition. MIT Press."},{"key":"e_1_3_2_1_10_1","unstructured":"2020. CSPLib: A problem library for constraints. http:\/\/csplib.org\/ 2020. CSPLib: A problem library for constraints. http:\/\/csplib.org\/"},{"key":"e_1_3_2_1_11_1","unstructured":"Apostolos Dimitromanolakis. 2002. Analysis Of The Golomb Ruler And The Sidon Set Problems And Determination Of Large Near-Optimal Golomb Rulers. Apostolos Dimitromanolakis. 2002. Analysis Of The Golomb Ruler And The Sidon Set Problems And Determination Of Large Near-Optimal Golomb Rulers."},{"volume-title":"MINION: A Fast, Scalable, Constraint Solver. In ECAI","year":"2006","author":"Gent Ian Philip","key":"e_1_3_2_1_12_1","unstructured":"Ian Philip Gent , Christopher Jefferson , and Ian Miguel . 2006 . MINION: A Fast, Scalable, Constraint Solver. In ECAI 2006, 17th European Conference on Artificial Intelligence, August 29 - September 1, 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings . Ian Philip Gent, Christopher Jefferson, and Ian Miguel. 2006. MINION: A Fast, Scalable, Constraint Solver. In ECAI 2006, 17th European Conference on Artificial Intelligence, August 29 - September 1, 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00081-3"},{"key":"e_1_3_2_1_14_1","unstructured":"2020. Java Tree Builder. http:\/\/compilers.cs.ucla.edu\/jtb\/ 2020. Java Tree Builder. http:\/\/compilers.cs.ucla.edu\/jtb\/"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.11.002"},{"key":"e_1_3_2_1_16_1","unstructured":"Matthew Kitching and Fahiem Bacchus. 2007. Symmetric Component Caching. In IJCAI. 118\u2013124. Matthew Kitching and Fahiem Bacchus. 2007. Symmetric Component Caching. In IJCAI. 118\u2013124."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2004.16"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/160"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3430665.3456360"},{"volume-title":"Combinatorial Problems and Exercises. AMS Chelsea Pub","year":"1842","author":"Lov\u00e1sz L\u00e1szl\u00f3","key":"e_1_3_2_1_20_1","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz . 2007. Combinatorial Problems and Exercises. AMS Chelsea Pub ., Providence, RI . isbn:978082 1842 621 0821842625 L\u00e1szl\u00f3 Lov\u00e1sz. 2007. Combinatorial Problems and Exercises. AMS Chelsea Pub., Providence, RI. isbn:9780821842621 0821842625"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892237"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00143877"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9064-x"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30201-8_2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/544741.544760"},{"volume-title":"INFORMS Annual Meeting.","year":"2006","author":"Schulte Christian","key":"e_1_3_2_1_28_1","unstructured":"Christian Schulte , Mikael Z. Lagerkvist , and Guido Tack . 2006 . Gecode: Generic constraint development environment . In INFORMS Annual Meeting. Christian Schulte, Mikael Z. Lagerkvist, and Guido Tack. 2006. Gecode: Generic constraint development environment. In INFORMS Annual Meeting."},{"volume-title":"Lagerkvist","year":"2019","author":"Schulte Christian","key":"e_1_3_2_1_29_1","unstructured":"Christian Schulte , Guido Tack , and Mikael Z . Lagerkvist . 2019 . Introduction. In Modeling and Programming with Gecode, Christian Schulte, Guido Tack, and Mikael Z. Lagerkvist (Eds.). Corresponds to Gecode 6.2.0. Christian Schulte, Guido Tack, and Mikael Z. Lagerkvist. 2019. Introduction. In Modeling and Programming with Gecode, Christian Schulte, Guido Tack, and Mikael Z. Lagerkvist (Eds.). Corresponds to Gecode 6.2.0."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564751_47"},{"key":"e_1_3_2_1_31_1","unstructured":"Peter J. Stuckey Kim Marriott and Guido Tack. 2020. FlatZinc and Flattening. https:\/\/www.minizinc.org\/doc-2.5.2\/en\/flattening.html Peter J. Stuckey Kim Marriott and Guido Tack. 2020. FlatZinc and Flattening. https:\/\/www.minizinc.org\/doc-2.5.2\/en\/flattening.html"},{"key":"e_1_3_2_1_32_1","unstructured":"Peter J. Stuckey Kim Marriott and Guido Tack. 2020. The MiniZinc IDE. https:\/\/www.minizinc.org\/doc-2.5.2\/en\/minizinc_ide.html Peter J. Stuckey Kim Marriott and Guido Tack. 2020. The MiniZinc IDE. https:\/\/www.minizinc.org\/doc-2.5.2\/en\/minizinc_ide.html"},{"key":"e_1_3_2_1_33_1","unstructured":"Peter J. Stuckey Kim Marriott and Guido Tack. 2021. Solving Technologies and Solver Backends. https:\/\/www.minizinc.org\/doc-2.4.3\/en\/solvers.html Peter J. Stuckey Kim Marriott and Guido Tack. 2021. Solving Technologies and Solver Backends. https:\/\/www.minizinc.org\/doc-2.4.3\/en\/solvers.html"},{"volume-title":"Comparing SAT and SMT Encodings of All-Different and Global Cardinality Constraints. Master\u2019s thesis","author":"Turner Charles","key":"e_1_3_2_1_34_1","unstructured":"Charles Turner . 2014. Comparing SAT and SMT Encodings of All-Different and Global Cardinality Constraints. Master\u2019s thesis . University of York. Charles Turner. 2014. Comparing SAT and SMT Encodings of All-Different and Global Cardinality Constraints. Master\u2019s thesis. University of York."},{"volume-title":"Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010","year":"2010","author":"Xu Lin","key":"e_1_3_2_1_35_1","unstructured":"Lin Xu , Holger H. Hoos , and Kevin Leyton-Brown . 2010 . Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection . In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010 , Atlanta, Georgia, USA , July 11-15, 2010. Lin Xu, Holger H. Hoos, and Kevin Leyton-Brown. 2010. Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2012.15"}],"event":{"name":"ESEC\/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Athens Greece","acronym":"ESEC\/FSE '21"},"container-title":["Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3468264.3468566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T11:11:04Z","timestamp":1673262664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468264.3468566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,18]]},"references-count":37,"alternative-id":["10.1145\/3468264.3468566","10.1145\/3468264"],"URL":"https:\/\/doi.org\/10.1145\/3468264.3468566","relation":{},"subject":[],"published":{"date-parts":[[2021,8,18]]},"assertion":[{"value":"2021-08-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}