Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Magic sets for data integration
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Consequence-driven reasoning for horn SHIQ ontologies
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the decidability and complexity of integrating ontologies and rules
Web Semantics: Science, Services and Agents on the World Wide Web
Reconciling description logics and rules
Journal of the ACM (JACM)
Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Well-founded semantics for description logic programs in the semantic web
ACM Transactions on Computational Logic (TOCL)
F-Logic#: Loosely Coupling F-Logic Rules and Ontologies
WI-IAT '10 Proceedings of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Effective integration of declarative rules with external evaluations for semantic-web reasoning
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Uniform evaluation of nonmonotonic DL-Programs
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
The deployment of knowledge representation formalisms to the Web has created the need for hybrid formalisms that combine heterogeneous knowledge bases. The aim of this research is to improve the reasoning efficiency over hybrid knowledge bases (KBs). The traditional way of reasoning over hybrid KBs is to use different underlying reasoners to access the different data sources, which causes overhead. To remedy this, we propose a new strategy, called inline evaluation, which compiles the whole hybrid KB into a new KB using only one single formalism. Hence we can use a single reasoner to do the reasoning tasks, and improve the efficiency of hybrid reasoning.