Conjunctive query containment and answering under description logic constraints
From MaRDI portal
Publication:5277811
DOI10.1145/1352582.1352590zbMath1367.68084OpenAlexW2141591281WikidataQ64360076 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
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Related Items (9)
On the data complexity of consistent query answering over graph databases ⋮ Regular queries on graph databases ⋮ Semantic query optimization in the presence of types ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Reasoning and Query Answering in Description Logics ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ Inductive Logic Programming in Databases: From <scp>Datalog</scp> to ⋮ Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints
This page was built for publication: Conjunctive query containment and answering under description logic constraints
