Khaled Belahcène

According to our database1, Khaled Belahcène authored at least 22 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Multiple criteria sorting models and methods. Part II: theoretical results and general issues.
4OR, June, 2023

Multiple criteria sorting models and methods - Part I: survey of the literature.
4OR, March, 2023

Ranking with Multiple Reference Points: Efficient SAT-based learning procedures.
Comput. Oper. Res., 2023

Les implicants premiers, un outil polyvalent pour l'explication de classification robuste.
Proceedings of the 17èmes Journées d'Intelligence Artificielle Fondamentale, 2023

Opérateurs totalement informatifs et ordres linéaires partitionnés en révision de croyances.
Proceedings of the 17èmes Journées d'Intelligence Artificielle Fondamentale, 2023

Des explications transitives questionnables au service de l'élicitation de préférences additives.
Proceedings of the 17èmes Journées d'Intelligence Artificielle Fondamentale, 2023

Prime implicants as a versatile tool to explain robust classification.
Proceedings of the International Symposium on Imprecise Probability: Theories and Applications, 2023

2022
Learning non-compensatory sorting models using efficient SAT/MaxSAT formulations.
Eur. J. Oper. Res., 2022

Preference elicitation for a ranking method based on multiple reference profiles.
4OR, 2022

Explaining Robust Classification Through Prime Implicants.
Proceedings of the Scalable Uncertainty Management - 15th International Conference, 2022

Explications de classifications robustes à l'aide d'implicants premiers.
Proceedings of the Rencontres francophones sur la Logique Floue et ses Applications, 2022

Explications de recommandations fondées sur des principes d'équité à l'aide de transferts.
Proceedings of the 16èmes Journées d'Intelligence Artificielle Fondamentale, 2022

Fragment explicable par schémas d'arguments des affectations nécessaires dans un tri non compensatoire.
Proceedings of the 16èmes Journées d'Intelligence Artificielle Fondamentale, 2022

Des explications par étapes pour le modèle additif.
Proceedings of the 16èmes Journées d'Intelligence Artificielle Fondamentale, 2022

2021
Combining Fairness and Optimality when Selecting and Allocating Projects.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
Equity in Learning Problems: An OWA Approach.
Proceedings of the Scalable Uncertainty Management - 14th International Conference, 2020

Learning Interpretable Models using Soft Integrity Constraints.
Proceedings of The 12th Asian Conference on Machine Learning, 2020

2019
Comparing Options with Argument Schemes Powered by Cancellation.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples.
Comput. Oper. Res., 2018

Accountable Approval Sorting.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
A Model for Accountable Ordinal Sorting.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2015
Explaining robust additive utility models by sequences of preference swaps.
CoRR, 2015


  Loading...