处理布尔网络最小陷阱空间的通用属性（英文版）

英文标题：Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks中文摘要：本文通过引入 CEGAR 辅助解决量化命题逻辑公式的满足性问题，针对寻找 Boolean 网络的特定属性和综合布尔网络两个问题进行了逻辑推理，同时通过实现 Answer-Set Programming 的原型来证明算法良好的可扩展性。英文摘要：Minimal trap spaces (MTSs) capture subspaces in which the Boolean dynamics istrapped, whatever the update mode. They correspond to the attractors of themost permissive mode. Due to their versatility, the computation of MTSs hasrecently gained traction, essentially by focusing on their enumeratio