Non-distributive Description Logic

Abstract

Abstract We define LE-$$\mathcal {ALC}$$, a generalization of the description logic $$\mathcal {ALC}$$ based on the propositional logic of general (i.e. not necessarily distributive) lattices, and semantically interpreted on relational structures based on formal contexts from Formal Concept Analysis (FCA). The description logic LE-$$\mathcal {ALC}$$ allows us to formally describe databases with objects, features, and formal concepts, represented according to FCA as Galois-stable sets of objects and features. We describe ABoxes and TBoxes in LE-$$\mathcal {ALC}$$, provide a tableaux algorithm for checking the consistency of LE-$$\mathcal {ALC}$$ knowledge bases with acyclic TBoxes, and show its termination, soundness and completeness. Interestingly, consistency checking for LE-$$\mathcal {ALC}$$ with acyclic TBoxes is in PTIME, while the complexity of the consistency checking of classical $$\mathcal {ALC}$$ with acyclic TBoxes is PSPACE-complete.