arXiv:2607. 21203v1 Announce Type: new Abstract: Description logic programs are a powerful formalism for combining rules with ontologies.
By Spencer Killen, Jia-Huai You
In Description Logics (DLs), reasoning under Rational Closure (RC) is a well-known and widely accepted non-monotonic formalism to handle defeasible knowledge. In this paper, we study the application of RC to the core and horn variants of the DL-Lite family of lightweight description logics.
arXiv:2606. 24279v1 Announce Type: new Abstract: In Description Logics (DLs), reasoning under Rational Closure (RC) is a well-known and widely accepted non-monotonic formalism to handle defeasible knowledge.
By Giovanni Casini (CNR - ISTI, University of Cape Town), Umberto Straccia (CNR - ISTI)
arXiv:2607. 16715v1 Announce Type: new Abstract: We study Controlled Query Evaluation (CQE), a declarative approach to confidentiality-preserving data access, in the context of Description Logic (DL) ontologies, and for confidentiality policies expressed through Epistemic Dependencies (EDs).
By Lorenzo Marconi, Daniela Rieti, Riccardo ROsati
arXiv:2601. 19644v2 Announce Type: replace-cross Abstract: Decidability or complexity issues about the consistency problem for description logics with concrete domains have already been analysed with tableaux-based or type elimination methods.
By St\'ephane Demri, Tianwen Gu
The paper introduces Class Expression Simplifier (CES), an algorithm that syntactically simplifies OWL class expressions in Description Logics. CES preserves formal semantics by applying rewriting rules to remove redundancies and produce simpler, equivalent expressions, resulting in more compact and human-readable representations. Experiments on two medium-sized ontologies show that CES improves reasoning efficiency and reduces verbosity, and the tool is available as an open-source Python package within OWLAPY.
By Alkid Baci, N'Dah Jean Kouagou, Caglar Demir, Axel-Cyrille Ngonga Ngomo