This is a review of some of the definitions of the concept of a stable model that have been proposed in the literature. These definitions are equivalent to each other, at least when applied to traditional Prolog-style programs, but there are reasons why each of them is valuable and interesting. A new characterization of stable models can suggest an alternative picture of the intuitive meaning of logic programs; or it can lead to new algorithms for generating stable models; or it can work better than others when we turn to generalizations of the traditional syntax that are important from the perspective of answer set programming; or it can be more convenient for use in proofs; or it can be interesting simply because it demonstrates a relationship between seemingly unrelated ideas.

PDF

In Proceedings of International Conference on Logic Programming (ICLP), pp. 37-51 2008.

@Inproceedings{lif08a, title={Twelve Definitions of a Stable Model}, author={Vladimir Lifschitz}, booktitle={Proceedings of International Conference on Logic Programming (ICLP)}, pages={37-51}, url="http://www.cs.utexas.edu/users/ai-lab?lif08a", year={2008} }