A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption

Salem Benferhat, Zied Bouraoui, Ma Thi Chau, Sylvain Lagrue, Julien Rossit

Abstract

The context of this paper is the one of merging lightweight ontologies with prioritized or uncertain assertional bases issued from different sources. This is especially required when the assertions are provided by multiple and often conflicting sources having different reliability levels. We focus on the so-called egalitarian merging problem which aims to minimize the dissatisfaction degree of each individual source. The question addressed in this paper is how to merge prioritized assertional bases, in a possibility theory framework, when the uncertainty scales are not commensurable, namely when the sources do not share the same meaning of uncertainty scales. Using the notion of compatible scale, we provide a safe way to perform merging. The main result of the paper is that the egalitarian merging of prioritized assertional bases can be achieved in a polynomial time even if the uncertainty scales are not commensurable.

References

  1. Augustin, T., Coolen, F. P. A., de Cooman, G., and Troffaes, M. C. M. (2003). Introduction to Imprecise Probabilities. Wiley.
  2. Benferhat, S. and Bouraoui, Z. (2015). Min-based possibilistic DL-Lite. Journal of Logic and Computation.
  3. Benferhat, S., Bouraoui, Z., and Loukil, Z. (2013). Minbased fusion of possibilistic dl-lite knowledge bases. In Web Intelligence, pages 23-28. IEEE Computer Society.
  4. Benferhat, S., Hué, J., Lagrue, S., and Rossit, J. (2011). Interval-based possibilistic logic. In Walsh, T., editor, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence , pages 750- 755. IJCAI/AAAI.
  5. Benferhat, S., Lagrue, S., and Rossit, J. (2007). An egalitarist fusion of incommensurable ranked belief bases under constraints. In Proceedings of the TwentySecond AAAI Conference on Artificial Intelligence, , pages 367-372. AAAI Press.
  6. Bloch, I., Hunter, A., Appriou, A., Ayoun, A., Benferhat, S., Besnard, P., Cholvy, L., Cooke, R. M., Cuppens, F., Dubois, D., Fargier, H., Grabisch, M., Kruse, R., Lang, J., Moral, S., Prade, H., Saffiotti, A., Smets, P., and Sossai, C. (2001). Fusion: General concepts and characteristics. Int. J. Intell. Syst., 16(10):1107-1134.
  7. Calvanese, D., Giacomo, G. D., Lembo, D., Lenzerini, M., and Rosati, R. (2007). Tractable reasoning and efficient query answering in description logics: The dl-lite family. J. Autom. Reasoning, 39(3):385-429.
  8. Dubois, D. and Prade, H. (1988). Possibility theory. Plenum Press, New-York.
  9. Konieczny, S. and Pino Pérez, R. (2002). Merging information under constraints: A logical framework. J. Log. Comput., 12(5):773-808.
  10. Wache, H., Vgele, T., Visser, U., Stuckenschmidt, H., Schuster, G., Neumann, H., and Hbner, S. (2001). Ontology-based integration of information - a survey of existing approaches. In In IJCAI01 Workshop. on Ontologies and Information Sharing.
  11. Wallner, A. (2007). Extreme points of coherent probabilities in finite spaces. Int. J. Approx. Reasoning, 44(3):339- 357.
Download


Paper Citation


in Harvard Style

Benferhat S., Bouraoui Z., Thi Chau M., Lagrue S. and Rossit J. (2017). A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption . In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-220-2, pages 415-422. DOI: 10.5220/0006120804150422


in Bibtex Style

@conference{icaart17,
author={Salem Benferhat and Zied Bouraoui and Ma Thi Chau and Sylvain Lagrue and Julien Rossit},
title={A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2017},
pages={415-422},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006120804150422},
isbn={978-989-758-220-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption
SN - 978-989-758-220-2
AU - Benferhat S.
AU - Bouraoui Z.
AU - Thi Chau M.
AU - Lagrue S.
AU - Rossit J.
PY - 2017
SP - 415
EP - 422
DO - 10.5220/0006120804150422