1. Andersen, K., and D. Pretolani. 2001. Easy cases of probabilistic satisfiability. Annals of Mathematics and Artificial Intelligence 33 (1): 69–91.
2. Baader, F., M. Buchheit, and B. Hollander. 1996. Cardinality restrictions on concepts. Artificial Intelligence 88 (1): 195–213.
3. Baader, F., S. Brandt, and C. Lutz. 2005. Pushing the EL envelope. In IJCAI05, 19th International Joint Conference on Artificial Intelligence, pp. 364–369.
4. Bertsimas, D., and J.N. Tsitsiklis. 1997. Introduction to Linear Optimization. Athena Scientific.
5. Biere, A. 2014. Lingeling essentials, a tutorial on design and implementation aspects of the the sat solver lingeling. In POS@ SAT, pp. 88. Citeseer.