Static Analysis of Logic Programs via Boolean Networks

TL;DR

This paper establishes a connection between logic programs and Boolean networks to enhance static analysis of Answer Set Programming, enabling the transfer of theoretical results and fostering new insights in ASP research.

Contribution

It introduces a novel framework linking ASP and Boolean networks, allowing static analysis techniques from Boolean network theory to be applied to ASP.

Findings

Unified framework for ASP static analysis and Boolean networks

Potential to derive new theoretical results for ASP

Enhanced understanding of stable models in logic programs

Abstract

Answer Set Programming (ASP) is a declarative problem solving paradigm that can be used to encode a combinatorial problem as a logic program whose stable models correspond to the solutions of the considered problem. ASP has been widely applied to various domains in AI and beyond. The question "What can be said about stable models of a logic program from its static information?" has been investigated and proved useful in many circumstances. In this work, we dive into this direction more deeply by making the connection between a logic program and a Boolean network, which is a prominent modeling framework with applications to various areas. The proposed connection can bring the existing results in the rich history on static analysis of Boolean networks to explore and prove more theoretical results on ASP, making it become a unified and powerful tool to further study the static analysis of ASP. In particular, the newly obtained insights have the potential to benefit many problems in the field of ASP.