Querying visible and invisible information

DOI10.1145/2933575.2935306MaRDI QIDQ4635885zbMATHOpenAlexFDO

Authors Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis

Publication date 23 April 2018

Published in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2933575.2935306

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 2080475
• scientific article; zbMATH DE number 1487934
• scientific article; zbMATH DE number 2080301
• scientific article; zbMATH DE number 1980948
• Answering queries using limited external query processors

Cited in

(6)

• The data complexity of ontology-mediated queries with closed predicates
• Logical foundations of information disclosure in ontology-based data integration
• On Monotonic Determinacy and Rewritability for Recursive Queries and Views
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
• scientific article; zbMATH DE number 1949689 (Why is no real title available?)
• Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates

This page was built for publication: Querying visible and invisible information

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