A Polynomial Algorithm For Merging Lightweight Ontologies In Possibility Theory Under Incommensurability Assumption - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

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

(1) , (1) , , (1)
1
Salem Benferhat
Centre de Recherche en Informatique de Lens
Zied Bouraoui
Centre de Recherche en Informatique de Lens
Ma Thi Chau
  • Function : Author
Sylvain Lagrue
Centre de Recherche en Informatique de Lens

Domains

Computer Science [cs] Artificial Intelligence [cs.AI]

Fabien DELORME  : Connect in order to contact the contributor

https://hal-univ-artois.archives-ouvertes.fr/hal-03299702

Submitted on : Monday, July 26, 2021-4:15:57 PM

Last modification on : Wednesday, February 8, 2023-5:11:18 PM

Not file

Dates and versions

hal-03299702 , version 1 (26-07-2021)

Identifiers

  • HAL Id : hal-03299702 , version 1

Cite

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

UNIV-ARTOIS CNRS CRIL
9 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More