paradigm. In The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag, Berlin, 375–398.

MARIEN¨ , M. 2009. Model generation for ID-logic. Ph.D. thesis, Katholieke Universiteit Leuven.

MARIEN¨ , M., GILIS, D., AND DENECKER, M. 2004. On the relation between ID-logic and answer set programming. In Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA 2004. Lecture Notes in Computer Science, vol. 3229. Springer, Berlin, 108–120.

MARIEN¨ , M., WITTOCX, J., DENECKER, M., AND BRUYNOOGHE, M. 2008. SAT(ID): Satisfiability of propositional logic extended with inductive definitions. In Proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008. Lecture Notes in Computer Science, vol. 4996. Springer, Berlin, 211–224.

NIEMELA¨ , I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 241–273.

NIEMELA¨ , I. AND SIMONS, P. 2000. Extending the Smodels system with cardinality and weight constraints. In Logic-Based Artificial Intelligence, J. Minker, Ed. Kluwer, Dordrecht, 491–521.

NIEUWENHUIS, R., OLIVERAS, A., AND TINELLI, C. 2006. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53(6), 937–977.

OIKARINEN, E. AND JANHUNEN, T. 2006. Modular equivalence for normal logic programs. In Proceedings of the 17th European Conference on Artificial Intelligence, ECAI 2006. IOS Press, Amsterdam, 412–416.

VAN GELDER, A., ROSS, K., AND SCHLIPF, J. 1991. The well-founded semantics for general logic programs. Journal of ACM 38, 3, 620–650.

WARD, J. AND SCHLIPF, J. 2004. Answer set programming with clause learning. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR
2004. Lecture Notes in Computer Science, vol. 2923. Springer, Berlin, 302–313.