{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:15:22Z","timestamp":1758672922658,"version":"3.44.0"},"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":[[2025,9]]},"abstract":"<jats:p>Boolean networks (BNs) are widely used to model biological regulatory networks. Attractors here hold significant meaning as they represent long-term behaviors such as homeostasis and the results of cell differentiation. As such, computing attractors is of critical importance to guarantee the validity of a model or to assess its stability and robustness. However, this problem is quite challenging when it comes to large real-world models. To overcome the limits of state-of-the-art BDD-based or ASP-based enumeration approaches, we introduce a SAT-based approach to compute fixed points (singleton attractors) of BN and exhibit its merits for counting the number of singleton attractors of large-scale benchmarks well established in the literature.<\/jats:p>","DOI":"10.24963\/ijcai.2025\/290","type":"proceedings-article","created":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:10:40Z","timestamp":1758269440000},"page":"2601-2609","source":"Crossref","is-referenced-by-count":0,"title":["A SAT-based Method for Counting All Singleton Attractors in Boolean Networks"],"prefix":"10.24963","author":[{"given":"Rei","family":"Higuchi","sequence":"first","affiliation":[{"name":"Kobe University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takehide","family":"Soh","sequence":"additional","affiliation":[{"name":"Kobe University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Le Berre","sequence":"additional","affiliation":[{"name":"CRIL-CNRS UMR 8188, Universit\u00e9 d'Artois"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morgan","family":"Magnin","sequence":"additional","affiliation":[{"name":"LS2N, UMR 6004"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mutsunori","family":"Banbara","sequence":"additional","affiliation":[{"name":"Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoyuki","family":"Tamura","sequence":"additional","affiliation":[{"name":"Kobe University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"34","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2025","name":"Thirty-Fourth International Joint Conference on Artificial Intelligence {IJCAI-25}","start":{"date-parts":[[2025,8,16]]},"theme":"Artificial Intelligence","location":"Montreal, Canada","end":{"date-parts":[[2025,8,22]]}},"container-title":["Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T11:33:37Z","timestamp":1758627217000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2025\/290"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2025\/290","relation":{},"subject":[],"published":{"date-parts":[[2025,9]]}}}