Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

A Polynomial Algorithm For Merging Lightweight Ontologies In Possibility Theory Under Incommensurability Assumption

Document type :
Conference papers
Complete list of metadata

https://hal-univ-artois.archives-ouvertes.fr/hal-03299702
Contributor : Fabien DELORME Connect in order to contact the contributor
Submitted on : Monday, July 26, 2021 - 4:15:57 PM
Last modification on : Wednesday, November 3, 2021 - 9:19:45 AM

Identifiers

  • HAL Id : hal-03299702, version 1

Collections

Citation

Salem Benferhat, Zied Bouraoui, Ma Thi Chau, Sylvain Lagrue. A Polynomial Algorithm For Merging Lightweight Ontologies In Possibility Theory Under Incommensurability Assumption. the 9th International Conference on Agents and Artificial Intelligence (ICAART'17), 2017, Porto, Portugal. pp.415-422. ⟨hal-03299702⟩

Share

Metrics

Record views

7