
## Acknowledgments

This research of the first author was supported by the National Science Foundation under Grant IIS-0325063. This research of the second author was supported by the National Science Foundation under Grant DMS 0654060.

## References

[Ap90] Apt, K.. Logic programming, In: J. van Leeuven, ed, *Handbook of* Theoretical Computer Science, pages 493–574, MIT Press, 1990.

| [Bo04]   | Bonatti, P.A. Reasoning with infinite stable models. Artificial Intelligence 156:75–111, 2004.                                                                                                                                                                                                  |
|----------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| [BTK93]  | Bondarenko, A., Toni, F. and Kowalski, R.A., An Assumption-Based Framework for Non-Monotonic Reasoning. Proceedings of LPNMR93, MIT Press, pages 171–189, 1993.                                                                                                                                                                                                  |
| [Cl78]   | Clark, K. Negation as failure. In Logic and data bases, H. Gallaire and J. Minker, Eds. Plenum Press, pages 293–322, 1978.                                                                       |
| [DP92]   | Davey, B.A., and Priestley, H.A., Introduction to Lattices and Order, Cambridge University Press, 1992.                                                                                          |
| [DK89]   | Dung, P.M. and Kanchanasut, K., On the generalized predicate completion of non-Horn programs, Logic programming. Proceedings of the North American Conference, 1989.                                                                                                                                                                                                  |
| [Do94]   | Doets, K., From Logic to Logic Programming, MIT Press, 1994.                                                                                                                                     |
| [FL05]   | Ferraris, P., and Lifschitz, V., Weight constraints as nested expressions, Theory and Practice of Logic Programming, 5:45-74, 2005.                                                                                                                                                                                                  |
| [FLL06]  | Ferraris, P., Lee, J. and Lifschitz, V. A generalization of Lin-Zhao theorem. Annals of Mathematics and Artificial Intelligence 47:79– 101, 2006.                                                |
| [GS07]   | Gebser, M. and Schaub, T., Generic Tableaux for Answer Set Programming, Proceedings of International Conference on Logic Programming, 2007, pages 119–133, 2007.                                                                                                                                                                                                  |
| [GL88]   | Gelfond, M. and Lifschitz, V. The stable model semantics for logic programming. In Proceedings. of the International Joint Conference and Symposium on Logic Programming, pages 1070–1080, 1988. |
