A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption

Salem Benferhat, Zied Bouraoui, Ma Thi Chau, Sylvain Lagrue, Julien Rossit. A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption. In H. Jaap van den Herik, Ana Paula Rocha, Joaquim Filipe, editors, Proceedings of the 9th International Conference on Agents and Artificial Intelligence, ICAART 2017, Volume 2, Porto, Portugal, February 24-26, 2017. pages 415-422, SciTePress, 2017. [doi]

Authors

Salem Benferhat

This author has not been identified. Look up 'Salem Benferhat' in Google

Zied Bouraoui

This author has not been identified. Look up 'Zied Bouraoui' in Google

Ma Thi Chau

This author has not been identified. Look up 'Ma Thi Chau' in Google

Sylvain Lagrue

This author has not been identified. Look up 'Sylvain Lagrue' in Google

Julien Rossit

This author has not been identified. Look up 'Julien Rossit' in Google