( en | de | ru )

 

Disambiguation of "Rossit, Julien"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Julien Köhrle

Julien Ndinga

Julien Bonnamour

Julien Chantel

Julien Gaugaz

 

Other publications of authors with the same name

Introducing the Fourth International Competition on Computational Models of Argumentation., , , and . SAFA@COMMA, volume 2672 of CEUR Workshop Proceedings, page 80-85. CEUR-WS.org, (2020)Admissibility in Strength-Based Argumentation: Complexity and Algorithms., , , and . COMMA, volume 353 of Frontiers in Artificial Intelligence and Applications, page 44-55. IOS Press, (2022)Argument, I Choose You! Preferences and Ranking Semantics in Abstract Argumentation., and . KR, page 647-651. (2020)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)A New Evolutive Generator for Graphs with Communities and its Application to Abstract Argumentation., , , and . Arg&App@KR, volume 3472 of CEUR Workshop Proceedings, page 52-64. CEUR-WS.org, (2023)An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints., , and . AAAI, page 367-372. AAAI Press, (2007)Un logiciel permettant d'apprendre des règles et leurs exceptions : Area., , and . EGC, volume RNTI-E-6 of Revue des Nouvelles Technologies de l'Information, page 745-746. Cépaduès-Éditions, (2006)A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption., , , , and . ICAART (2), page 415-422. SciTePress, (2017)An Analysis of Sum-Based Incommensurable Belief Base Merging., , and . SUM, volume 5785 of Lecture Notes in Computer Science, page 55-67. Springer, (2009)