1. Lecture Notes in Computer Science;M. Gebser,2009
2. Balduccini, M.: Representing constraint satisfaction problems in answer set programming. In: Working Notes of the Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP (2009)
3. Janhunen, T., Liu, G., Niemelä, I.: Tight integration of non-ground answer set programming and satisfiability modulo theories. In: Working notes of the 1st Workshop on Grounding and Transformations for Theories with Variables (2011)
4. Bartholomew, M., Lee, J.: Functional stable model semantics and answer set programming modulo theories. In: Proceedings of International Joint Conference on Artificial Intelligence, IJCAI (2013)
5. Bartholomew, M., Lee, J.: Stable models of formulas with intensional functions. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 2–12 (2012)