Updating OWL2 ontologies using pruned rulesets

ABSTRACT

Evolution in Semantic Web content produces difference files (deltas) that track changes between ontology versions. These changes may represent ontology modifications or simply changes in application data. An ontology is typically expressed in a combination of OWL and RDF knowledge representation languages. A data repository that represents an ontology may be large and may be duplicated over the Internet, often in the form of a relational datastore. The deltas can be used to reduce the storage and bandwidth overhead involved in disseminating ontology updates. Minimising the delta size can be achieved by reasoning over the underlying knowledge base. OWL 2 is a development of the OWL 1 standard that incorporates new features to aid application construction. Among the sub languages of OWL 2, OWL 2 RL/RDF provides an enriched rule set that extends the semantic capability of the OWL environment. This additional semantic content can be exploited in change detection approaches that strive to minimise the alterations to be made when ontologies are updated. The presence of blank nodes (i.e. nodes that are neither a URI nor a literal) in RDF collections provides a further challenge to ontology change detection. This is a consequence of the practical problems they introduce when comparing data structures before and after update. In the light of OWL 2 RL/RDF, this paper examines the potential for reducing the delta size by pruning the application of unnecessary rules from the reasoning process and using an approach to delta generation that produces the smallest number of updates. It also assesses the impact of alternative approaches to handling blank nodes during the change detection process in ontology structures. The results indicate that pruning the rule set is a potentially expensive process but has the benefit of reducing the joins over relational data stores when carrying out the subsequent inferencing.

References

1. S. M. M. Al Azwari and J. Wilson. Consistent RDF updates with correct dense deltas. In Proc 30th BICOD, 2015.
2. J. J. Carroll and G. Klyne. Resource description framework (RDF): Concepts and abstract syntax. 2004.
3. CVS - concurrent versions system. http://www.nongnu.org/cvs/. Accessed: 2015-06-10.
4. Y. Guo, Z. Pan, and J. Heflin. Lubm: A benchmark for OWL knowledge base systems. Web Semantics: Science, Services and Agents on the World Wide Web, 3(2):158--182, 2005.
5. P. Hayes and B. McBride. RDF semantics. W3C recommendation. World Wide Web Consortium, 2004.
6. A. Hogan and S. Decker. On the ostensibly silent 'W' in OWL 2 RL. In Web Reasoning and Rule Systems, pages 118--134. Springer, 2009.
7. D.-H. Im, S.-W. Lee, and H.-J. Kim. Backward inference and pruning for RDF change detection using RDBMS. J. Info. Science, 39(2):238--255, 2013.
8. M. Klein. Supporting evolving ontologies on the internet. In XML-Based Data Management and Multimedia Engineering - EDBT 2002 Workshops, pages 597--606. Springer, 2002.
9. V. Kolovski, Z. Wu, and G. Eadon. Optimizing enterprise-scale OWL 2 RL reasoning in a relational database system. In The Semantic Web--ISWC 2010, pages 436--452. Springer, 2010.
10. L. Ma, Y. Yang, Z. Qiu, G. Xie, Y. Pan, and S. Liu. Towards a complete OWL ontology benchmark. Springer, 2006.
11. B. Motik, B. C. Grau, I. Horrocks, Z. Wu, A. Fokoue, and C. Lutz. OWL 2 web ontology language: Profiles. W3C recommendation, 27:61, 2009.
12. T. Neumann and G. Weikum. x-RDF-3X: Fast querying, high update rates, and consistency for RDF databases. Proceedings of the VLDB Endowment, 3(1-2):256--263, 2010.
13. N. F. Noy, M. A. Musen, et al. Promptdiff: A fixed-point algorithm for comparing ontology versions. AAAI/IAAI, 2002:744--750, 2002.
14. M. Völkel and T. Groza. SemVersion: An RDF-based ontology versioning system. In Proceedings of the IADIS international conference WWW/Internet, volume 2006, page 44, 2006.
15. D. Zeginis, Y. Tzitzikas, and V. Christophides. On computing deltas of RDF/S knowledge bases. ACM Trans on the Web (TWEB), 5(3):14, 2011.

Index Terms

• Mathematics of computing

  • Discrete mathematics

    • Graph theory