{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:34:46Z","timestamp":1723016086530},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p>When solving a combinatorial problem using propositional satisfiability (SAT), the encoding of the constraints  is of vital importance.\n\nPseudo-Boolean (PB) constraints  appear frequently in a wide variety of problems. When PB constraints occur together with at-most-one (AMO) constraints over the same variables, they can be combined into PB(AMO) constraints.\n\nIn this paper we present new encodings  for PB(AMO) constraints.\n\nOur experiments show that these encodings  can be substantially smaller than those of PB constraints and allow many more instances to be solved within a time limit.\n\nWe also observed that there is no single overall winner among the considered encodings, but efficiency of each encoding may depend on PB(AMO) characteristics such as the magnitude of coefficient values.<\/jats:p>","DOI":"10.24963\/ijcai.2023\/769","type":"proceedings-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T04:31:30Z","timestamp":1691728290000},"page":"6853-6857","source":"Crossref","is-referenced-by-count":0,"title":["SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract)"],"prefix":"10.24963","author":[{"given":"Miquel","family":"Bofill","sequence":"first","affiliation":[{"name":"Universitat de Girona"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Coll","sequence":"additional","affiliation":[{"name":"Institut d'Investigaci\u00f3 en Intel\u00b7lig\u00e8ncia Artificial (IIIA-CSIC)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Nightingale","sequence":"additional","affiliation":[{"name":"University of York"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep","family":"Suy","sequence":"additional","affiliation":[{"name":"Universitat de Girona"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Ulrich-Oltean","sequence":"additional","affiliation":[{"name":"University of York"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[{"name":"Universitat de Girona"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"32","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2023","name":"Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}","start":{"date-parts":[[2023,8,19]]},"theme":"Artificial Intelligence","location":"Macau, SAR China","end":{"date-parts":[[2023,8,25]]}},"container-title":["Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T04:55:45Z","timestamp":1691729745000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2023\/769"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2023\/769","relation":{},"subject":[],"published":{"date-parts":[[2023,8]]}}}