answer set programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard combinatorial problems. State-of-the-art
Answer Set Programming（ASP）是一个声明性问题解决范式，可以将组合问题编码为逻辑程序，其稳定模型对应于所考虑问题的解决方案。本文深入探讨了逻辑程序和布尔网络之间的连接，该连接对于进一步研究ASP的静态分析具有统一且强大的工具价值。尤其是，新获得的见解有潜力对ASP领域的许多问题带来好处。