Author of the publication

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

, , , , and . ICAART (2), page 415-422. SciTePress, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A possibilistic handling of partially ordered information, , and . CoRR, (2012)Merging Interval-Based Possibilistic Belief Bases., , , and . SUM, volume 7520 of Lecture Notes in Computer Science, page 447-458. Springer, (2012)Min-based Assertional Merging Approach for Prioritized DL-Lite Knowledge Bases., , , and . SUM, volume 8720 of Lecture Notes in Computer Science, page 8-21. Springer, (2014)How to Choose Weightings to Avoid Collisions in a Restricted Penalty Logic., and . KR, page 340-347. AAAI Press, (2008)A Lexicographic Inference for Partially Preordered Belief Bases., , , , and . KR, page 507-517. AAAI Press, (2008)An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints., , and . AAAI, page 367-372. AAAI Press, (2007)On aggregate and comparison functions for Motus/Lingo playing., , and . J. Int. Comput. Games Assoc., 40 (3): 258-268 (2018)An Analysis of Sum-Based Incommensurable Belief Base Merging., , and . SUM, volume 5785 of Lecture Notes in Computer Science, page 55-67. Springer, (2009)WoodStock : un programme-joueur générique., , , and . Rev. d'Intelligence Artif., 31 (3): 281-310 (2017)Fragment explicable par schémas d'arguments des affectations nécessaires dans un tri non compensatoire., , and . JIAF, page 35-46. (2022)