{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T07:20:32Z","timestamp":1778570432373,"version":"3.51.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["IJC2019-040489-I"],"award-info":[{"award-number":["IJC2019-040489-I"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["RTI2018-095609-B-I00"],"award-info":[{"award-number":["RTI2018-095609-B-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Intell Syst"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The B2B scheduling optimization problem consists of finding a schedule of a set of meetings between pairs of participants, minimizing their number of idle time periods. Recent works have shown that SAT-based approaches are state-of-the-art on this problem. One interesting feature of such approaches is the use of implied constraints. In this work, we provide an experimental setting to study the impact of using these implied constraints in MaxSAT B2B instances. To this purpose and due to the reduced number of existing real-world B2B instances, we propose a random B2B instance generation model, which reproduces certain features of these problems. In our experimental analysis, we show that the impact of using some implied constraints in the MaxSAT encodings depends on the characteristics of the problem, and we also analyze the benefits of combining them. Finally, we give some insights on how a MaxSAT solver is able to exploit these implied constraints.<\/jats:p>","DOI":"10.1007\/s44196-022-00121-5","type":"journal-article","created":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T07:02:51Z","timestamp":1660201371000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Impact of Implied Constraints on MaxSAT B2B Instances"],"prefix":"10.1007","volume":"15","author":[{"given":"Miquel","family":"Bofill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Coll","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8963-6299","authenticated-orcid":false,"given":"Jes\u00fas","family":"Gir\u00e1ldez-Cru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep","family":"Suy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"key":"121_CR1","doi-asserted-by":"crossref","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: A parametric approach for smaller and better encodings of cardinality constraints. In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming (CP\u201913), vol. 8124, pp. 80\u201396 (2013)","DOI":"10.1007\/978-3-642-40627-0_9"},{"key":"121_CR2","doi-asserted-by":"crossref","unstructured":"Alsinet, T., B\u00e9jar, R., Cabiscol, A., Fern\u00e1ndez, C., Many\u00e0, F.: Minimal and redundant SAT encodings for the all-interval-series problem. In: Proceedings of the 5th International Conference of the Catalan Association for Artificial Intelligence CCIA 2002, pp. 139\u2013144 (2002)","DOI":"10.1007\/3-540-36079-4_12"},{"key":"121_CR3","unstructured":"Ans\u00f3tegui, C., del Val, A., Dot\u00fa, I., Fern\u00e1ndez, C., Many\u00e0, F.: Modeling choices in quasigroup completion: SAT vs. CSP. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI\u201904), pp. 137\u2013142 (2004)"},{"key":"121_CR4","doi-asserted-by":"crossref","unstructured":"Bofill, M., Coll, J., Garcia, M., Gir\u00e1ldez-Cru, J., Pesant, G., Suy, J., Villaret, M.: Constraint solving approaches to the business-to-business meeting scheduling problem. J. Artif. Intell. Res. (in press) (2022)","DOI":"10.1613\/jair.1.12670"},{"key":"121_CR5","doi-asserted-by":"crossref","unstructured":"Bofill, M., Espasa, J., Garcia, M., Palah\u00ed, M., Suy, J., Villaret, M.: Scheduling B2B meetings. In: Proceedings of the 20th international conference on principles and practice of constraint programming (CP\u201914), vol. 8656, pp. 781\u2013796 (2014)","DOI":"10.1007\/978-3-319-10428-7_56"},{"key":"121_CR6","doi-asserted-by":"crossref","unstructured":"Bofill, M., Garcia, M., Suy, J., Villaret, M.: MaxSAT-based scheduling of B2B meetings. In: Proceedings of the 12th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR\u201915), vol. 9075, pp. 65\u201373 (2015)","DOI":"10.1007\/978-3-319-18008-3_5"},{"key":"121_CR7","unstructured":"Bofill, M., Gir\u00e1ldez-Cru, J., Suy, J., Villaret, M.: A study on implied constraints in a maxsat approach to B2B problems. In: Proceedings of the 22nd International Conference of the Catalan Association for Artificial Intelligence (CCIA\u201919), vol. 319, pp. 183\u2013192 (2019)"},{"key":"121_CR8","doi-asserted-by":"crossref","unstructured":"Gebser, M., Glase, T., Sabuncu, O., Schaub, T.: Matchmaking with answer set programming. In: Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201913), pp. 342\u2013347 (2013)","DOI":"10.1007\/978-3-642-40564-8_34"},{"key":"121_CR9","unstructured":"Kautz, H.\u00a0A., Ruan, Y., Achlioptas, D., Gomes, C.\u00a0P., Selman, B., Stickel, M.\u00a0E.: Balance and filtering in structured satisfiable problems. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI\u201901), pp. 351\u2013358 (2001)"},{"key":"121_CR10","unstructured":"Li, C.\u00a0M., Many\u00e0, F.: Handbook of satisfiability, chapter MaxSAT. In: Hard and Soft Constraints, pp. 613\u2013631. IOS Press (2009)"},{"key":"121_CR11","doi-asserted-by":"crossref","unstructured":"Martins, R., Manquinho, V.M., Lynce, I.: Open-WBO: a modular MaxSAT solver. In: Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing (SAT\u201914), pp. 438\u2013445 (2014)","DOI":"10.1007\/978-3-319-09284-3_33"},{"key":"121_CR12","doi-asserted-by":"crossref","unstructured":"Pesant, G., Rix, G., Rousseau, L.: A comparative study of MIP and CP formulations for the B2B scheduling optimization problem. In: Proceedings of the 12th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR\u201915). LNCS, vol. 9075, pp. 306\u2013321. Springer (2015)","DOI":"10.1007\/978-3-319-18008-3_21"},{"key":"121_CR13","unstructured":"Selman, B., Kautz, H.A., McAllester, D.A.: Ten challenges in propositional reasoning and search. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI\u201997), pp. 50\u201354 (1997)"}],"container-title":["International Journal of Computational Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-022-00121-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44196-022-00121-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-022-00121-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T07:40:20Z","timestamp":1660203620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44196-022-00121-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,11]]},"references-count":13,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["121"],"URL":"https:\/\/doi.org\/10.1007\/s44196-022-00121-5","relation":{},"ISSN":["1875-6883"],"issn-type":[{"value":"1875-6883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,11]]},"assertion":[{"value":"26 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval and Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"63"}}