1. Achlioptas, D., Beame, P., Molloy, M.: A sharp threshold in proof complexity. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 337–346. ACM, New York (2001)
2. Lecture Notes in Computer Science;C. Anger,2005
3. Anger, C., Gebser, M., Janhunen, T., Schaub, T.: What’s a head without a body? In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Proc. of the 17th European Conference on Artificial Intelligence (ECAI), pp. 769–770. IOS, Amsterdam (2006)
4. Babovich, Y., Lifschitz, V.: Computing answer sets using program completion. Available at http://www.cs.utexas.edu/users/tag/cmodels/cmodels-1.ps (2003)
5. Calimeri, F., Faber, W., Leone, N., Pfeifer, G.: Pruning operators for disjunctive logic programming systems. Fundam. Inform. 71(2-3), 183–214 (2006)