Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic design ...

This paper investigates the robust set stabilization of Boolean control networks (BCNs) under the influence of random disturbances. In contrast to prevailing algebraic methods, we propose an efficient ...