Controlled query evaluation in description logics through consistent query answering

DOI10.1016/J.ARTINT.2024.104176MaRDI QIDQ6592995zbMATHFDO

Authors Gianluca Cima, Domenico Lembo, Riccardo Rosati, Domenico Fabio Savo

Publication date 26 August 2024

Published in Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

query answeringdescription logicsontologiesdata complexityconfidentiality preservation

Mathematics Subject Classification ID

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

Recommendations

• The impossibility of keeping secrets
• Confidentiality policies and their enforcement for controlled query evaluation
• Controlled query evaluation with open queries for a decidable relational submodel
• A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
• View-based query answering in description logics: semantics and complexity

Cites work

• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2232435 (Why is no real title available?)
• A conceptual framework for secrecy-preserving reasoning in knowledge bases
• A false sense of security
• A formal analysis of information disclosure in data exchange
• Answering queries without revealing secrets
• Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes
• Controlled query evaluation for known policies by combining lying and refusal
• Data Privacy for $\mathcal{ALC}$ Knowledge Bases
• Data complexity of query answering in description logics
• Data exchange: semantics and query answering
• Database Theory - ICDT 2005
• For unknown secrecies refusal is better than lying
• Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
• Inconsistency-tolerant query answering for existential rules
• Logical foundations of information disclosure in ontology-based data integration
• Logical foundations of linked data anonymisation
• Lying versus refusal for known potential secrets
• Preference-based inconsistency-tolerant query answering under existential rules
• The Description Logic Handbook
• The price of query rewriting in ontology-based data access
• Tractable query answering and rewriting under description logic constraints
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• View-based query answering in description logics: semantics and complexity

This page was built for publication: Controlled query evaluation in description logics through consistent query answering

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