Abstract
An ontology signature (set of entities) can express more than its constituent concept, role and individual names, since rewriting permits defined entities to be replaced by syntactically different, albeit semantically equivalent definitions. Identifying whether a given signature permits the definition of a particular entity is a well-understood problem, while determining the smallest (minimal) signature that covers a set of entities (i.e. a task signature) poses a challenge: the complete set of alternative definitions, or even just their signature, needs to be obtained, and all combinations of such definition signatures need to be explored, for each of the entities under consideration. In this paper, we present and empirically evaluate our novel approach for efficiently computing an approximation of minimal signature cover sets.
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
Similar content being viewed by others
References
Baader, F.: The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
Beth, E.W.: On Padoa’s method in the theory of definition. Indagationes Mathematicae 15, 330–339 (1953)
Euzenat, J., Shvaiko, P.: Ontology Matching, 2nd edn. Springer, Heidelberg (2013)
Geleta, D., Payne, T.R., Tamma, V.: An investigation of definability in ontology alignment. In: Blomqvist, E., Ciancarini, P., Poggi, F., Vitali, F. (eds.) EKAW 2016. LNCS (LNAI), vol. 10024, pp. 255–271. Springer, Cham (2016). doi:10.1007/978-3-319-49004-5_17
Geleta, D., Payne, T.R., Tamma, V.: Computing minimal signature coverage for description logic ontologies. Technical report, ULCS-16-004, University of Liverpool (2016)
Hoogland, E., et al.: Definability and interpolation: model-theoretic investigations. Institute for Logic, Language and Computation (2001)
Horridge, M., Bechhofer, S.: The OWL API: a Java API for OWL ontologies. Semant. Web 2(1), 11–21 (2011)
Jiménez-Ruiz, E., Payne, T.R., Solimando, A., Tamma, V.: Avoiding alignment-based conservativity violations through dialogue. In: Proceedings of the OWLED, vol. 15 (2015)
Payne, T.R., Tamma, V.: Using preferences in negotiations over ontological correspondences. In: Chen, Q., Torroni, P., Villata, S., Hsu, J., Omicini, A. (eds.) PRIMA 2015. LNCS (LNAI), vol. 9387, pp. 319–334. Springer, Cham (2015). doi:10.1007/978-3-319-25524-8_20
Santos, G., Tamma, V., Payne, T.R., Grasso, F.: Dialogue based meaning negotiation. In: The 15th Workshop on Computational Models of Natural Argument (CMNA 2015) (2015)
Ten Cate, B., Franconi, E., Seylan, I.: Beth definability in expressive description logics. J. Artif. Intell. Res. (JAIR) 48, 347–414 (2013)
Van Harmelen, F., Ten Teije, A., Wache, H.: Knowledge engineering rediscovered: towards reasoning patterns for the semantic web. In: Fensel, D. (ed.) Foundations for the Web of Information and Services, pp. 57–75. Springer, Heidelberg (2011)
Vardi, M.Y.: Fundamentals of dependency theory. IBM Thomas J. Watson Research Division (1985)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Geleta, D., Payne, T.R., Tamma, V. (2017). Minimal Coverage for Ontology Signatures. In: Dragoni, M., Poveda-Villalón, M., Jimenez-Ruiz, E. (eds) OWL: Experiences and Directions – Reasoner Evaluation. OWLED ORE 2016 2016. Lecture Notes in Computer Science(), vol 10161. Springer, Cham. https://doi.org/10.1007/978-3-319-54627-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-54627-8_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-54626-1
Online ISBN: 978-3-319-54627-8
eBook Packages: Computer ScienceComputer Science (R0)