Abstract
The best practices for Linked Data design recommend reusing known ontologies. However, the process of reusing an ontology involves two issues: (1) selecting a set of terms from the ontology vocabulary; and (2) using the ontology constraints to derive those that apply to such terms. The first issue is quite simple and corresponds to the familiar practice of importing namespaces. This paper proposes to address the second issue by introducing a set of operations that create new ontologies, including their constraints, out of other ontologies. The operations treat ontologies as theories and not just as vocabularies. The paper proceeds to show how to compute the operations for lightweight ontologies, that is, ontologies built upon DL-Lite core with arbitrary number restrictions. It also addresses the question of minimizing the set of constraints of a lightweight ontology that results from an operation. Finally, the paper describes a tool that implements the operations and offers other facilities to manipulate lightweight ontologies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Garey, M.R., Ullman, J.D.: The Transitive Reduction of a Directed Graph. SIAM J. Comp. 1(2), 131–137 (1972)
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. of Artificial Intelligence Research 36(1), 1–69 (2009)
Baader, F., Nutt, W.: Basic Description Logics. In: Baader, F., Calvanese, D., McGuiness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.) The Description Logic Handbook: Theory, Implementation and Applications, pp. 43–95. Cambridge U. Press, Cambridge (2003)
Berners-Lee, T.: Linked Data - Design Issues. W3C (July 2006)
Bizer, C., Cyganiak, R., Heath, T.: How to publish Linked Data on the Web (July 2007), http://www4.wiwiss.fu-berlin.de/bizer/pub/LinkedDataTutorial/
Bizer, C., Heath, T., Berners-Lee, T.: Linked Data - The Story So Far. Int. Journal on Semantic Web and Information Systems 5(3), 1–22 (2009)
Brickley, D., Miller, L.: FOAF Vocabulary Specification 0.98. Namespace Document 9 Marco Polo Edition (August 2010)
Casanova, M.A., Lauschner, T., Leme, L.A.P.P., Breitman, K.K., Furtado, A.L., Vidal, V.M.P.: Revising the Constraints of Lightweight Mediated Schemas. Data & Knowledge Engineering 69(12), 1274–1301 (2010)
Casanova, M.A., Beitman, K.K., Furtado, A.L., Vidal, V.M.P., Macedo, J.A.F., Gomes, R.V.A., Salas, P.E.R.: The Role of Constraints in Linked Data. In: Meersman, R., Dillon, T., Herrero, P., Kumar, A., Reichert, M., Qing, L., Ooi, B.-C., Damiani, E., Schmidt, D.C., White, J., Hauswirth, M., Hitzler, P., Mohania, M. (eds.) OTM 2011, Part II. LNCS, vol. 7045, pp. 781–799. Springer, Heidelberg (2011)
Casanova, M.A., Breitman, K.K., Furtado, A.L., Vidal, V.M.P., Macêdo, J.A.F.: An Efficient Proof Procedure for a Family of Lightweight Database Schemas. In: Hinchey, M.G. (ed.) Conquering Complexity, pp. 431–461. Springer (2012)
Das, S., Sundara, S., Cyganiak, R.: R2rml: RDB to RDF mapping language. W3C RDB2RDF working group, http://www.w3.org/TR/r2rml/
Halpin, H., Hayes, P.J.: When owl:sameAs isn’t the same: An analysis of identity links on the semantic web. In: Proc. Int’l. Workshop on Linked Data on the Web (2010)
Hsu, H.T.: An Algorithm for Finding a Minimal Equivalent Graph of a Digraph. Journal of the Association for Computing Machinery 22(1), 11–16 (1975)
Jaffri, A., Glaser, H., Millard, I.: URI disambiguation in the context of linked data. In: Proc. 1st Int’l. Workshop on Linked Data on the Web (2008)
Jain, P., Hitzler, P., Yeh, P.Z., Verma, K., Sheth, A.P.: Linked Data is Merely More Data. In: Proc. AAAI Spring Symp. Linked Data Meets Artificial Intelligence, pp. 82–86 (2010)
Khuller, S., Raghavachari, B., Young, N.: Approximating the Minimum Equivalent Digraph. SIAM Journal on Computing 24(4), 859–872 (1995)
McCusker, J., McGuinness, D.L.: owl:sameAs considered harmful to provenance. In: Proc. ISCB Conference on Semantics in Healthcare and Life Sciences (2010)
Jain, P., Hitzler, P., Sheth, A.P., Verma, K., Yeh, P.Z.: Ontology Alignment for Linked Open Data. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) ISWC 2010, Part I. LNCS, vol. 6496, pp. 402–417. Springer, Heidelberg (2010)
Raimond, Y., Giasson, F.: Music Ontology Specification. Specification Document (RDF/XML, Turtle) (November 28, 2010), http://purl.org/ontology/mo/
Sahoo, S.S., Halb, W., Hellmann, S., Idehen, K., Thibodeau Jr, T., Auer, S., Sequeda, J., Ezzat, A.: A survey of current approaches for mapping of relational databases to rdf. W3C RDB2RDF Incubator Group Report (2009)
Wang, Z., Zhang, X., Hou, L., Li, J.: RiMOM2: A Flexible Ontology Matching Framework. In: Proc. ACM WebSci 2011, Koblenz, Germany, pp. 1–2 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Casanova, M.A. et al. (2012). Operations over Lightweight Ontologies. In: Meersman, R., et al. On the Move to Meaningful Internet Systems: OTM 2012. OTM 2012. Lecture Notes in Computer Science, vol 7566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33615-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-33615-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33614-0
Online ISBN: 978-3-642-33615-7
eBook Packages: Computer ScienceComputer Science (R0)