On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Combining Horn rules and description logics in CARIN
Artificial Intelligence
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Portrait of the Semantic Web in Action
IEEE Intelligent Systems
A Conjunctive Query Language for Description Logic Aboxes
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Answering Queries Using Views over Description Logics Knowledge Bases
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Reasoning with Individuals for the Description Logic SHIQ
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Conceptual modeling with description logics
The description logic handbook
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
A tableaux decision procedure for SHOIQ
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Toward expressive syndication on the web
Proceedings of the 16th international conference on World Wide Web
Hybrid Logics and Ontology Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Journal of Automated Reasoning
The Complexity of Conjunctive Query Answering in Expressive Description Logics
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Extending Carin to the Description Logics of the $\mathcal{SH}$ Family
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
A unified apriori-like algorithm for conjunctive query containment
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
On Combining Description Logic Ontologies and Nonrecursive Datalog Rules
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Semantic Web Service Selection at the Process-Level: The eBay/Amazon/PayPal Case Study
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Semantically Enabled Framework for User Centric Profile Description, Search and Match
Service-Oriented Computing - ICSOC 2007 Workshops
Exploiting conjunctive queries in description logic programs
Annals of Mathematics and Artificial Intelligence
DL-lite in the light of first-order logic
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
Conjunctive query answering for the description logic SHIQ
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Tractable Query Answering over Conceptual Schemata
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
The DL-lite family and relations
Journal of Artificial Intelligence Research
Expressive reasoning with horn rules and fuzzy description logics
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Querying incomplete data with logic programs: ER strikes back
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Conjunctive queries for a tractable fragment of OWL 1.1
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Journal on data semantics X
Querying incomplete data over extended er schemata
Theory and Practice of Logic Programming
Query answering under expressive entity-relationship schemata
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Completeness guarantees for incomplete reasoners
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Conjunctive query answering in the description logic SH using knots
Journal of Computer and System Sciences
The limits of querying ontologies
ICDT'07 Proceedings of the 11th international conference on Database Theory
Ontological query answering under expressive Entity-Relationship schemata
Information Systems
Temporalizing ontology-based data access
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Query rewriting under query refinements
Knowledge-Based Systems
Hi-index | 0.00 |
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly seen also as a mechanism to access and query data repositories. This novel context poses an original combination of challenges that has not been addressed before: (i) sufficient expressive power of the DL to capture common data modeling constructs; (ii) well established and flexible query mechanisms such as Conjunctive Queries (CQs); (iii) optimization of inference techniques with respect to data size, which typically dominates the size of ontologies. This calls for investigating data complexity of query answering in expressive DLs. While the complexity of DLs has been studied extensively, data complexity has been characterized only for answering atomic queries, and was still open for answering CQs in expressive DLs. We tackle this issue and prove a tight CONP upper bound for the problem in SHIQ, as long as no transitive roles occur in the query. We thus establish that for a whole range of DLs from AL to SHIQ, answering CQs with no transitive roles has CONP-complete data complexity. We obtain our result by a novel tableaux-based algorithm for checking query entailment, inspired by the one in [19], but which manages the technical challenges of simultaneous inverse roles and number restrictions (which leads to a DL lacking the finite model property).