1. Baader F (1996) Using automata theory for characterizing the semantics of terminological cycles. Ann Math Artif Intell 18:175–219
2. Baader F, Calvanese D, McGuinness D, Nardi D, Patel-Schneider PF (2003) The description logic handbook: theory, implementation, and applications. Cambridge University Press, New York
3. Baader F, Fernández Gil O, Marantidis P (2017) Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in ${\cal{FL}}_0$. In: Drewes F, Martín-Vide C, Truthe B (eds) Proceedings of the 11th international conference on language and automata theory and applications (LATA 2017), Lecture Notes in Computer Science. Springer, pp 3–26
4. Baader F, Fernández Gil O, Marantidis P (2018) Matching in the description logic ${\cal{FL}}_0$ with respect to general TBoxes. In: Barthe G, Sutcliffe G, Veanes M (eds) Proceedings of the 22nd international conference on logic for programming, artificial intelligence and reasoning (LPAR’18), EPiC Series in Computing, EasyChair, pp 76–94
5. Baader F, Fernández Gil O, Pensel M (2018) Standard and non-standard inferences in the description logic ${\cal{FL}}_0$. In: Lee D, Steen A, Walsh T (eds) 4th Global conference on artificial intelligence (GCAI 2018). EPiC Series in Computing, EasyChair, pp 1–14