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:2606. 24618v1 Announce Type: new Abstract: In ontology-based data access (OBDA), multiple data sources are integrated via mappings to an ontology.
By Michel Lecl\`ere, Marie-Laure Mugnier, Guillaume P\'erution-Kihli
arXiv:2601. 18747v2 Announce Type: replace-cross Abstract: Modern AI agents increasingly rely on search infrastructure to execute complex, neuro-symbolic reasoning workflows.
By Amir Aavani
arXiv:2604. 26976v2 Announce Type: replace-cross Abstract: We study the problem of fitting a description logic (DL) ontology to a given set of positive and negative examples that take the form of an ABox and a Boolean query.
By Marvin Grosser, Carsten Lutz
arXiv:2608. 04945v1 Announce Type: cross Abstract: The emergence of the ISO standard GQL introduces a powerful query language extending first-order logic with controlled recursion, raising the question of its applicability to evaluation of ontology-mediated queries (OMQs).
By David Carral, Calixte Gruson, Quentin Mani\`ere
The emergence of the ISO standard GQL introduces a powerful query language extending first-order logic with controlled recursion, raising the question of its applicability to evaluation of ontology-mediated queries (OMQs). We focus on OMQs consisting of atomic queries over ontologies expressed in Horn-ALCHI, an expressive Description Logic that is not, in general, first-order rewritable.
arXiv:2003. 05746v5 Announce Type: replace-cross Abstract: In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between conflicting facts.
By Meghyn Bienvenu, Camille Bourgaux
arXiv:2607. 06407v1 Announce Type: new Abstract: The XAI community has studied a wide range of queries and scores for explaining predictions of ML models.
By Marcelo Arenas, Pablo Barcel\'o, Diego Bustamante, Jose Caraball, Mar\'ia Alejandra Schild, Bernardo Subercaseaux
arXiv:2606. 14309v1 Announce Type: cross Abstract: Property graphs may be constrained by schemas that inform both query engines and human users about the shape of valid data, enforcing a contract between data provider and consumer.
By Philipp Seifer, Daniel Hern\'andez, Ralf L\"ammel, Steffen Staab
arXiv:2606. 28076v1 Announce Type: new Abstract: Knowledge graph question answering (KGQA) aims to answer natural-language questions by reasoning over structured facts.
By Yongxue Shan, Meihan Wu, Cundi Fang, Jie Peng, Xiaodong Wang
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
arXiv:2606. 00050v1 Announce Type: new Abstract: We present Grokers, an architecture for building persistent, structured comprehension of typed knowledge graphs through bottom-up inductive traversal of dependency subgraphs.
By Gregory Magarshak