A SAT-based Method for Counting All Singleton Attractors in Boolean Networks
Open Access
- 1 September 2025
- conference paper
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 3, 2601-2609
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.Keywords
This publication has 6 references indexed in Scilit:
- Attractor detection and enumeration algorithms for Boolean networksComputational and Structural Biotechnology Journal, 2022
- BioLQM: A Java Toolkit for the Manipulation and Conversion of Logical Qualitative Models of Biological NetworksFrontiers in Physiology, 2018
- A Knowledge Compilation MapJournal of Artificial Intelligence Research, 2002
- The Origins of Order: Self-Organization and Selection in Evolution1992
- Homeostasis and Differentiation in Random Genetic Control NetworksNature, 1969
- Metabolic stability and epigenesis in randomly constructed genetic netsJournal of Theoretical Biology, 1969