Julien Rossit

Orcid: 0000-0001-5275-4435

According to our database¹, Julien Rossit authored at least 24 papers between 2006 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

A New Evolutive Generator for Graphs with Communities and its Application to Abstract Argumentation.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Argumentation and Applications co-located with 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023), 2023

Revisiting Approximate Reasoning Based on Grounded Semantics.

[BibT_eX]

[DOI]

Jérôme Delobelle

Jean-Guy Mailly

Julien Rossit

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2023

2022

Admissibility in Strength-based Argumentation: Complexity and Algorithms (Extended Version with Proofs).

[BibT_eX]

[DOI]

CoRR, 2022

Admissibility in Strength-Based Argumentation: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2022

2021

Design and Results of ICCMA 2021.

[BibT_eX]

[DOI]

CoRR, 2021

United we stand: Accruals in strength-based argumentation.

[BibT_eX]

[DOI]

Argument Comput., 2021

2020

Stability in Abstract Argumentation.

[BibT_eX]

[DOI]

Jean-Guy Mailly

Julien Rossit

CoRR, 2020

Argument, I Choose You! Preferences and Ranking Semantics in Abstract Argumentation.

[BibT_eX]

[DOI]

Jean-Guy Mailly

Julien Rossit

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Introducing the Fourth International Competition on Computational Models of Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 8th International Conference on Computational Models of Argument (COMMA 2020), 2020

2017

Rationalisation of Profiles of Abstract Argumentation Frameworks: Characterisation and Complexity.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

Rationalisation of Profiles of Abstract Argumentation Frameworks: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

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

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

2016

Merging of Abstract Argumentation Frameworks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Rationalisation of Profiles of Abstract Argumentation Frameworks.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Merging Incommensurable Possibilistic DL-Lite Assertional Bases.

[BibT_eX]

[DOI]

Proceedings of the Joint Ontology Workshops 2015 Episode 1: The Argentine Winter of Ontology co-located with the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), 2015

2014

Sum-based weighted belief base merging: From commensurable to incommensurable framework.

[BibT_eX]

[DOI]

Salem Benferhat

Sylvain Lagrue

Julien Rossit

Int. J. Approx. Reason., 2014

Min-based Assertional Merging Approach for Prioritized DL-Lite Knowledge Bases.

[BibT_eX]

[DOI]

Salem Benferhat