Sciweavers

Share
KR
2010
Springer

On the Progression Semantics and Boundedness of Answer Set Programs

9 years 7 months ago
On the Progression Semantics and Boundedness of Answer Set Programs
In this paper, we propose a progression semantics for firstorder 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 equivalence, and is also equivalent to first-order definability of answer set programs on arbitrary structures.
Yan Zhang, Yi Zhou
Added 14 Feb 2011
Updated 14 Feb 2011
Type Journal
Year 2010
Where KR
Authors Yan Zhang, Yi Zhou
Comments (0)
books