Abstract
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 equivalence, and is also equivalent to first-order definability of answer set programs on arbitrary structures.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Twelfth International Conference on the Principles of Knowledge Representation and Reasoning (KR2010), Toronto, Canada, 9-13 May 2010 |
| Publisher | AAAI Press |
| Pages | 518-526 |
| Number of pages | 9 |
| ISBN (Print) | 9781577354512 |
| Publication status | Published - 2010 |
| Event | International Conference on Principles of Knowledge Representation and Reasoning - Duration: 10 Jun 2012 → … |
Conference
| Conference | International Conference on Principles of Knowledge Representation and Reasoning |
|---|---|
| Period | 10/06/12 → … |