2000 character limit reached
Query Answering in Lattice-based Description Logic (2409.02289v2)
Published 3 Sep 2024 in cs.LO
Abstract: Recently, the description logic LE-ALC 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. In this paper, we study the ontology-mediated query answering in LE-ALC . In particular, we show that several different types of queries can be answered efficiently for LE-ALC knowledge bases with acyclic TBoxes using our tableaux algorithm directly or by extending it with some additional rules.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.