loading
Papers

Research.Publish.Connect.

Paper

Authors: Salem Benferhat 1 ; Zied Bouraoui 2 ; Ma Thi Chau 3 ; Sylvain Lagrue 1 and Julien Rossit 4

Affiliations: 1 Artois University, France ; 2 Cardiff University, United Kingdom ; 3 VNU - University of Engineering and Technology, Vietnam ; 4 Paris Descartes University, France

ISBN: 978-989-758-220-2

Keyword(s): Lightweight Ontologies, Possibility Theory, Belief Merging, Incommensurability.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Knowledge Representation and Reasoning ; Symbolic Systems ; Uncertainty in AI

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.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.208.159.25

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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

@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},
}

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.