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
Zied Bouraoui
Ma Thi Chau
  • Function : Author
Sylvain Lagrue
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⟩
9 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More