{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:48:23Z","timestamp":1759682903023,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030802226"},{"type":"electronic","value":"9783030802233"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80223-3_1","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["OptiLog: A Framework for SAT-based Systems"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Ans\u00f3tegui","sequence":"first","affiliation":[]},{"given":"Jes\u00fas","family":"Ojeda","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Pacheco","sequence":"additional","affiliation":[]},{"given":"Josep","family":"Pon","sequence":"additional","affiliation":[]},{"given":"Josep M.","family":"Salvia","sequence":"additional","affiliation":[]},{"given":"Eduard","family":"Torres","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B Adenso-Diaz","year":"2006","unstructured":"Adenso-Diaz, B., Laguna, M.: Fine-tuning of algorithms using fractional experimental design and local search. Oper. Res. 54(1), 99\u2013114 (2006)","journal-title":"Oper. Res."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Ansotegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, pp. 142\u2013157 (2009)","DOI":"10.1007\/978-3-642-04244-7_14"},{"key":"1_CR3","unstructured":"Ans\u00f3tegui, C., Malitsky, Y., Samulowitz, H., Sellmann, M., Tierney, K.: Model-based genetic algorithms for algorithm configuration. In: IJCAI, pp. 733\u2013739 (2015)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-51825-7_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"G Audemard","year":"2020","unstructured":"Audemard, G., Paulev\u00e9, L., Simon, L.: SAT heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 107\u2013113. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_8"},{"key":"1_CR5","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern sat solvers. In: Proceedings of the 21st International Joint Conference on Artifical Intelligence, pp. 399\u2013404. IJCAI 2009. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2009)"},{"key":"1_CR6","unstructured":"Bacchus, F., Berg, J., J\u00e4rvisalo, M., Martins, R.: MaxSAT evaluation 2020: solver and benchmark descriptions (2020)"},{"key":"1_CR7","unstructured":"Balyo, T., contributors: The standard interface for incremental satisfiability solving. https:\/\/github.com\/biotomas\/ipasir (2014)"},{"issue":"2\u20134","key":"1_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.3233\/SAT190039","volume":"4","author":"A Biere","year":"2008","unstructured":"Biere, A.: PicoSAT essentials. J. Satisfiability, Boolean Model. Comput. 4(2\u20134), 75\u201397 (2008)","journal-title":"J. Satisfiability, Boolean Model. Comput."},{"key":"1_CR9","unstructured":"Biere, A.: Lingeling, plingeling and treengeling entering the sat competition 2013. Proc. SAT Competition 2013, 1 (2013)"},{"key":"1_CR10","unstructured":"Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Competition 2020 - Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51\u201353. University of Helsinki (2020)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., St\u00fctzle, T.: F-Race and iterated F-Race: an overview. In: Empirical Methods for the Analysis of Optimization Algorithms, pp. 311\u2013336 (2010)","DOI":"10.1007\/978-3-642-02538-9_13"},{"key":"1_CR12","unstructured":"Chollet, F., et al.: Keras (2015). https:\/\/github.com\/fchollet\/keras"},{"key":"1_CR13","unstructured":"COIN-OR Foundation: Computational infrastructure for operations research. https:\/\/www.coin-or.org\/ (2016)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating Pseudo-Boolean Constraints into SAT. J. Satisfiability, Boolean Model. Comput. 2(1\u20134), 1\u201326 (2006). IOS Press","DOI":"10.3233\/SAT190014"},{"key":"1_CR17","unstructured":"Gamrath, G., et al.: The SCIP Optimization Suite 7.0. ZIB-Report 20\u201310, Zuse Institute Berlin, March 2020"},{"key":"1_CR18","unstructured":"Google: Google OR-Tools. https:\/\/developers.google.com\/optimization (2021)"},{"key":"1_CR19","unstructured":"Gurobi Optimization: Gurobi. https:\/\/www.gurobi.com\/ (2021)"},{"issue":"7825","key":"1_CR20","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"Harris, C.R., et al.: Array programming with NumPy. Nature 585(7825), 357\u2013362 (2020). https:\/\/doi.org\/10.1038\/s41586-020-2649-2","journal-title":"Nature"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential Model-Based Optimization for General Algorithm Configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K., Stuetzle, T.: ParamILS: an automatic algorithm configuration framework. JAIR 36, 267\u2013306 (2009)","journal-title":"JAIR"},{"key":"1_CR23","unstructured":"IBM: IBM ILOG CPLEX. https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio (2021)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a Python toolkit for prototyping with SAT oracles. In: SAT, pp. 428\u2013437 (2018)","DOI":"10.1007\/978-3-319-94144-8_26"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-319-66263-3_30","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"M Lauria","year":"2017","unstructured":"Lauria, M., Elffers, J., Nordstr\u00f6m, J., Vinyals, M.: CNFgen: a generator of crafted benchmarks. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 464\u2013473. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_30"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Le Berre, D., Parrain, A.: The Sat4j library, release 2.2. J. Satisfiability, Boolean Model. Comput. 7(2\u20133), 59\u201364 (2010). IOS Press","DOI":"10.3233\/SAT190075"},{"key":"1_CR27","unstructured":"Logic and Optimization Group: Optilog official documentation (2021). http:\/\/ulog.udl.cat\/static\/doc\/optilog\/html\/index.html"},{"key":"1_CR28","unstructured":"Logic Optimization Group: PyPBLib: PBLib Python3 bindings. https:\/\/pypi.org\/project\/pypblib\/ (2019)"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"McKinney, W.: Data Structures for Statistical Computing in Python. In: van der Walt, S., Millman, J. (eds.) In: Proceedings of the 9th Python in Science Conference, pp. 56\u201361 (2010). https:\/\/doi.org\/10.25080\/Majora-92bf1922-00a","DOI":"10.25080\/Majora-92bf1922-00a"},{"key":"1_CR30","unstructured":"Paszke, A., et al.: Pytorch: an imperative style, high-performance deep learning library. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019 Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32, pp. 8024\u20138035. Curran Associates, Inc. (2019)"},{"key":"1_CR31","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-24318-4_2","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Philipp","year":"2015","unstructured":"Philipp, T., Steinke, P.: PBLib \u2013 a library for encoding pseudo-Boolean constraints into CNF. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 9\u201316. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_2"},{"key":"1_CR33","unstructured":"Van Rossum, G., Drake, F.L.: Python 3 Reference Manual. CreateSpace, Scotts Valley, CA (2009)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80223-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T23:28:17Z","timestamp":1625182097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iiia.csic.es\/sat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}