Query Answering in Lattice-based Description Logic

Recently, the description logic LE-A L C was introduced for reasoning in the semantic environment of the enriched formal contexts, and a tableaux algorithm was developed for checking the consistency of ABoxes in this logic [6, 7]. In this paper, we study the ontology-mediated query answering in LEA L C. In particular, we show that several different types of queries can be answered efficiently for LE-A L C knowledge bases with acyclic TBoxes using our tableaux algorithm directly or by extending it with some additional rules.