Enhancing cooperativity in controlled query evaluation over ontologies

DOI10.1016/J.ARTINT.2025.104402MaRDI QIDQ6916829zbMATH OpenFDO

Authors P. A. Bonatti, Gianluca Cima, Domenico Lembo, Francesco Magliocca, Lorenzo Marconi, Riccardo Rosati, L. Sauro, Domenico Fabio Savo

Publication date 14 October 2025

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2025.104402

zbMATH Keywords

query answeringdescription logicsontologiesdata complexityconfidentiality preservation

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Cites work

• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• A false sense of security
• A formal analysis of information disclosure in data exchange
• An introduction to description logic
• Answering queries without revealing secrets
• Controlled query evaluation for known policies by combining lying and refusal
• Controlled query evaluation in description logics through consistent query answering
• Controlled query evaluation with open queries for a decidable relational submodel
• For unknown secrecies refusal is better than lying
• Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
• Logical foundations of information disclosure in ontology-based data integration
• Logical foundations of linked data anonymisation
• More complicated questions about maxima and minima, and some closures of NP
• The complexity of optimization problems
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family

This page was built for publication: Enhancing cooperativity in controlled query evaluation over ontologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6916829)