Conjunctive query containment and answering under description logic constraints

DOI10.1145/1352582.1352590zbMath1367.68084WikidataQ64360076 ScholiaQ64360076MaRDI QIDQ5277811

Maurizio Lenzerini, Giuseppe De Giacomo, Diego Calvanese

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

computational complexity; description logics; query containment; conjunctve queries

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68P15: Database theory

68T27: Logic in artificial intelligence

68T30: Knowledge representation

Related Items

Reasoning and Query Answering in Description Logics, Semantic query optimization in the presence of types, Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots, Answering regular path queries in expressive description logics via alternating tree-automata, On the data complexity of consistent query answering over graph databases, Regular queries on graph databases, Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints, Ontology-Mediated Query Answering with Data-Tractable Description Logics, Inductive Logic Programming in Databases: From <scp>Datalog</scp> to