On the Minimality of Stable Models
The class of logic programs covered by the original definition of a stable model has the property that all stable models of a program in this class are minimal. In the course of research on answer set programming, the concept of a stable model was extended to several new programming constructs, and for some of these extensions the minimality property does not hold. We are interested in syntactic conditions on a logic program that guarantee the minimality of its stable models. This question is addressed here in the context of the general theory of stable models of first-order sentences.
Unable to display preview. Download preview PDF.
- [Apt et al., 1988]
- [Bidoit and Froidevaux, 1987]Bidoit, N., Froidevaux, C.: Minimalism subsumes default logic and circumscription in stratified logic programming. In: Proceedings LICS 1987, pp. 89–97 (1987)Google Scholar
- [Eiter et al., 2005]Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer-set programming. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 97–102 (2005)Google Scholar
- [Ferraris et al., 2010]
- [Ferraris, 2005]
- [Gelfond and Lifschitz, 1988]Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of International Logic Programming Conference and Symposium, pp. 1070–1080. MIT Press, Cambridge (1988)Google Scholar
- [Gelfond, 1987]Gelfond, M.: On stratified autoepistemic theories. In: Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 207–211 (1987)Google Scholar
- [Kim et al., 2009]Kim, T.-W., Lee, J., Palla, R.: Circumscriptive event calculus as answer set programming. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 823–829 (2009)Google Scholar
- [McCarthy, 1986]
- [Van Gelder et al., 1988]
- [Van Gelder, 1988]