eprintid: 2645
rev_number: 12
eprint_status: archive
userid: 318
dir: disk0/00/00/26/45
datestamp: 2017-12-08 04:41:03
lastmod: 2017-12-08 04:43:27
status_changed: 2017-12-08 04:41:03
type: conference_item
metadata_visibility: show
creators_name: Salem, Benferhat
creators_name: Zied, Bouraoui
creators_name: Ma, Thi Chau
creators_name: Sylvain, Lagrue
creators_name: Julien, Rossit
creators_id: chaumt@vnu.edu.vn
title: A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption
ispublished: pub
subjects: IT
divisions: fac_fit
date: 2017-01
date_type: published
full_text_status: none
pres_type: paper
event_title: 9th International Conference on Agents and Artificial Intelligence (ICCART)
event_location: Portugal
event_dates: 24-26 February 2017
event_type: conference
refereed: TRUE
related_url_url: https://www.researchgate.net/publication/314538227_A_Polynomial_Algorithm_for_Merging_Lightweight_Ontologies_in_Possibility_Theory_Under_Incommensurability_Assumption
citation:   Salem, Benferhat and Zied, Bouraoui and Ma, Thi Chau and Sylvain, Lagrue and Julien, Rossit  (2017) A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption.  In: 9th International Conference on Agents and Artificial Intelligence (ICCART), 24-26 February 2017, Portugal.