Query Answering in Lattice-based Description Logic

TL;DR

This paper explores efficient ontology-mediated query answering in the LE-ALC description logic, extending existing tableaux algorithms to handle various query types with acyclic TBoxes.

Contribution

It introduces methods for efficient query answering in LE-ALC, expanding the applicability of tableaux algorithms for different query types.

Findings

Query answering can be performed efficiently in LE-ALC with acyclic TBoxes.

The tableaux algorithm can be extended with additional rules for various query types.

The approach improves reasoning efficiency in semantic environments using LE-ALC.

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.