Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Characterizing data complexity for conjunctive query answering in expressive description logics
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Decidability of SHIQ with complex role inclusion axioms
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
How to decide query containment under constraints using a description logic
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Web Semantics: Science, Services and Agents on the World Wide Web
The Complexity of Conjunctive Query Answering in Expressive Description Logics
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Query Answering in the Description Logic Horn-$\mathcal{SHIQ}$
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Extending Carin to the Description Logics of the $\mathcal{SH}$ Family
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Cheap Boolean Role Constructors for Description Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Worst-case optimal conjunctive query answering for an expressive description logic without inverses
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Conjunctive query answering in the description logic EL using a relational database system
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Deciding Query Entailment for Fuzzy $\mathcal{SHIN}$ Ontologies
ASWC '09 Proceedings of the 4th Asian Conference on The Semantic Web
Reconciling description logics and rules
Journal of the ACM (JACM)
SPARQL1.1: new features and friends (OWL2, RIF)
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Fundamenta Informaticae
Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
Journal of Artificial Intelligence Research
Conjunctive query answering in the description logic SH using knots
Journal of Computer and System Sciences
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
Acyclicity notions for existential rules and their application to query answering in ontologies
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries--namely conjunctive ones--can be used in conjunction with OWL such that one of the major design criteria of the latter--namely decidability--can be retained. More precisely, we show that querying the tractable fragment ƐL++ of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted ƐL++ is undecidable.