Abstract
Ontology matching reconciles semantic heterogeneity between ontologies to find correspondence of entities, including classes, properties, and instances. We propose using ProbLog program to tackle this problem. It uses probabilistic facts to encode initial similarities (priors) of candidate matching pairs and exploits definite clauses and annotated disjunctions to respectively express certain and probabilistic influence of matching pairs. We experimentally evaluate our method on the datasets of conference track in Ontology Alignment Evaluation Initiative. Experimental results show: (1) recall is improved compared with priors; (2) our method is better in precision, recall and \(\mathtt {F_{1}}\)-measure than the most related Markov logic networks.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Domingos, P., Richardson, M.: 1 markov logic: A unifying framework for statistical relational learning. Statistical Relational Learning (2007) 339
Niepert, M., Meilicke, C., Stuckenschmidt, H.: A probabilistic-logical framework for ontology matching. In: AAAI. Citeseer (2010)
De Raedt, L., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: IJCAI, vol. 7
Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Lifschitz, V., Demoen, B. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 431–445. Springer, Heidelberg (2004)
Shterionov, D., Renkens, J., Vlasselaer, J., Kimmig, A., Meert, W., Janssens, G.: The most probable explanation for probabilistic logic programs with annotated disjunctions. status: accepted (2015)
Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Proceedings of the 12th International Conference on Logic Programming (ICLP95). Citeseer (1995)
Shvaiko, P., Euzenat, J.: Ontology matching: state of the art and future challenges. IEEE Transactions on Knowledge and Data Engineering 25, 158–176 (2013)
Euzenat, J., Shvaiko, P., et al.: Ontology Matching, vol. 18. Springer, Heidelberg (2007)
Fierens, D., Van den Broeck, G., Renkens, J., Shterionov, D., Gutmann, B., Thon, I., Janssens, G., De Raedt, L.: Inference and learning in probabilistic logic programs using weighted boolean formulas. In: Theory and Practice of Logic Programming, pp. 1–44 (2013)
Darwiche, A.: New advances in compiling cnf to decomposable negation normal form. In: Proc. of ECAI, pp. 328–332. Citeseer (2004)
Mantadelis, T., Janssens, G.: Dedicated tabling for a probabilistic setting. In: Technical Communications of the 26th International Conference on Logic Programming, vol. 7, pp. 124–133 (2010)
Lloyd, J.W.: Foundations of logic programming. Springer Science & Business Media (2012)
Albagli, S., Ben-Eliyahu-Zohary, R., Shimony, S.E.: Markov network based ontology matching. Journal of Computer and System Sciences 78, 105–118 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, Y. (2015). ProbLog Program Based Ontology Matching. In: Zhang, S., Wirsing, M., Zhang, Z. (eds) Knowledge Science, Engineering and Management. KSEM 2015. Lecture Notes in Computer Science(), vol 9403. Springer, Cham. https://doi.org/10.1007/978-3-319-25159-2_72
Download citation
DOI: https://doi.org/10.1007/978-3-319-25159-2_72
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25158-5
Online ISBN: 978-3-319-25159-2
eBook Packages: Computer ScienceComputer Science (R0)