Expressiveness of restricted recursive queries
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Datalog programs and their persistency numbers
ACM Transactions on Computational Logic (TOCL)
The Description Logic Handbook
The Description Logic Handbook
Description Logic Reasoning with Decision Diagrams
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Foundations of Semantic Web Technologies
Foundations of Semantic Web Technologies
Efficient inferencing for OWL EL
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
A comparison of reasoning techniques for querying large description logic ABoxes
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Uniform evaluation of nonmonotonic DL-Programs
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Complexities of Horn Description Logics
ACM Transactions on Computational Logic (TOCL)
The not-so-easy task of computing class subsumptions in OWL RL
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Datalog-based framework for efficient query answering over fuzzy ontologies
International Journal of Metadata, Semantics and Ontologies
| Hi-index | 0.00 |
We review recent results on inferencing for SROEL(×), a description logic that subsumes the main features of the W3C recommendation OWL EL. Rule-based deduction systems are developed for various reasoning tasks and logical sublanguages. Certain feature combinations lead to increased space upper bounds for materialisation, suggesting that efficient implementations are easier to obtain for suitable fragments of OWL EL.