Making the most of your triple store

作者: Yujiao Zhou , Bernardo Cuenca Grau , Ian Horrocks , Zhe Wu , Jay Banerjee

DOI: 10.1145/2488388.2488525

关键词:

摘要: Triple stores implementing the RL profile of OWL 2 are becoming increasingly popular. In contrast to unrestricted 2, is known enjoy favourable computational properties for query answering, and state-of-the-art reasoners such as OWLim Oracle's native inference engine Oracle Spatial Graph have proved extremely successful in industry-scale applications. The expressive restrictions imposed by may, however, be problematical some this paper, we propose novel techniques that allow us (in many cases) compute exact answers using an off-the-shelf reasoner, even when ontology outside profile. Furthermore, cases where cannot computed, can still both lower upper bounds on answers. These estimate degree incompleteness reasoner given query, optimise computation a fully-fledged reasoner. A preliminary evaluation RDF Semantic feature Database has shown very promising results with respect scalability tightness bounds.

参考文章(43)
Edward Thomas, Jeff Z. Pan, Yuting Zhao, Completeness Guaranteed Approximations for OWL-DL Query Answering. international workshop description logics. ,vol. 477, pp. 1- 12 ,(2009)
Volker Haarslev, Michael Wessel, Ralf Möller, Querying the Semantic Web with Racer + nRQL ,(2004)
Giorgos Stoilos, Bernardo Cuenca Grau, Martha Imprialou, Benchmarking ontology-based query rewriting systems national conference on artificial intelligence. pp. 779- 785 ,(2012)
Giorgos Stoilos, Bernardo Cuenca Grau, What to ask to an incomplete semantic web reasoner international joint conference on artificial intelligence. pp. 2226- 2231 ,(2011) , 10.5591/978-1-57735-516-8/IJCAI11-371
Markus Krötzsch, Boris Motik, Ian Horrocks, Despoina Magka, Bernardo Cuenca Grau, Clemens Kupke, Zhe Wang, Acyclicity conditions and their application to query answering in description logics principles of knowledge representation and reasoning. pp. 243- 253 ,(2012)
Alissa Kaplunova, Ralf Möller, Sebastian Wandelt, Michael Wessel, Towards scalable instance retrieval over ontologies knowledge science engineering and management. ,vol. 6291, pp. 436- 448 ,(2010) , 10.1007/978-3-642-15280-1_40
Tuvshintur Tserendorj, Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler, Approximate OWL-Reasoning with Screech web reasoning and rule systems. ,vol. 5341, pp. 165- 180 ,(2008) , 10.1007/978-3-540-88737-9_13
Andreas Nonnengart, Christoph Weidenbach, Computing small clause normal forms Handbook of Automated Reasoning. pp. 335- 367 ,(2001) , 10.1016/B978-044450813-3/50008-4
Vladimir Kolovski, Zhe Wu, George Eadon, Optimizing enterprise-scale OWL 2 RL reasoning in a relational database system international semantic web conference. pp. 436- 452 ,(2010) , 10.1007/978-3-642-17746-0_28
Ian Horrocks, Sergio Tessaris, A Conjunctive Query Language for Description Logic Aboxes national conference on artificial intelligence. pp. 399- 404 ,(2000)