A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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]

The following publications are possibly variants of this publication:

Partially Preordered Inconsistent Lightweight Ontologies in Possibility TheorySihem Belabbes, Salem Benferhat. isaim 2018: [doi]

Uncertain lightweight ontologies in a product-based possibility theory frameworkKhaoula Boutouhami, Salem Benferhat, Faiza Khellaf, Farid Nouioua. ijar, 88:237-258, 2017. [doi]

Representing Lightweight Ontologies in a Product-Based Possibility Theory FrameworkSalem Benferhat, Khaoula Boutouhami, Faiza Khellaf, Farid Nouioua. smps 2017: 45-52 [doi]

runs on WebDSL