{"type":"ScholarlyArticle","title":"A SAT-based Method for Counting All Singleton Attractors in Boolean Networks","authors":[{"name":"Rei Higuchi","slug":"rei-higuchi","given":"Rei","family":"Higuchi","affiliation":""},{"name":"Takehide Soh","slug":"takehide-soh","given":"Takehide","family":"Soh","affiliation":""},{"name":"Daniel Le Berre","slug":"daniel-le-berre","given":"Daniel","family":"Le Berre","affiliation":""},{"name":"Morgan Magnin","slug":"morgan-magnin","given":"Morgan","family":"Magnin","affiliation":""},{"name":"Mutsunori Banbara","slug":"mutsunori-banbara","given":"Mutsunori","family":"Banbara","affiliation":""},{"name":"Naoyuki Tamura","slug":"naoyuki-tamura","given":"Naoyuki","family":"Tamura","affiliation":""}],"abstract":"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.","doi":"10.24963/ijcai.2025/290","url":"https://ijcai.org/proceedings/2025/290","pdf":"https://ijcai.org/proceedings/2025/0290.pdf","markdown":"https://ijcai.org/proceedings/2025/290.md","bibtex":"https://ijcai.org/proceedings/2025/bibtex/290","volume":{"slug":"2025","title":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2025","url":"https://ijcai.org/proceedings/2025/","year":2025,"location":"Montreal, Canada","dates":"16-22 August 2025","editors":"James Kwok","isbn":"978-1-956792-06-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2025"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":290,"pages":{"first":2601,"last":2609},"keywords":["Constraint Satisfaction and Optimization: CSO: Modeling","Constraint Satisfaction and Optimization: CSO: Satisfiabilty","Constraint Satisfaction and Optimization: CSO: Applications","Constraint Satisfaction and Optimization: CSO: Solvers and tools"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}