1. Ackermann, W.: Uber die Erfullbarkeit gewisser Zahlausdrucke. Math. Ann. 100, 638–649 (1928)
2. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-lite family and relations. J. Artif. Intell. Res. 36, 1–69 (2009). https://doi.org/10.1613/jair.282
3. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005, Edinburgh, Scotland, UK, 30 July–5 August 2005, pp. 364–369. Professional Book Center (2005). http://ijcai.org/Proceedings/05/Papers/0372.pdf
4. Berger, R.: The undecidability of the dominoe problem. Mem. Amer. Math. Soc. 66, 1–72 (1966)
5. van Emde Boas, P.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory. pp. 331–363. Marcel Dekker Inc. (1997)