On the progression semantics and boundedness of answer set programs
Yan Zhang, Yi Zhou · 2010
In this paper, we propose a progression semantics for first-order answer set programs. Based on this new semantics, we are able to define the notion of boundedness for answer set programming. We prove that boundedness coincides with the notions of recursion-free and loop-free under program equiv-alence, and is also equivalent to first-order definability of an-swer set programs on arbitrary structures.