default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKhaled Belahcène
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Manuel Amoussou, Khaled Belahcène, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane
:
Questionable stepwise explanations for a robust additive preference model. Int. J. Approx. Reason. 171: 108982 (2024)- [c18]Vincent Auriau, Khaled Belahcène, Emmanuel Malherbe, Vincent Mousseau:
Learning Multiple Multicriteria Additive Models from Heterogeneous Preferences. ADT 2024: 207-224 - [c17]Hénoïk Willot, Khaled Belahcène, Sébastien Destercke:
Principled Explanations for Robust Redistributive Decisions. ECAI 2024: 979-986 - [c16]Hénoïk Willot, Khaled Belahcène, Sébastien Destercke:
Explications et caractérisation de décisions équitables. JIAF-JFPDA 2024: 68-78 - 2023
- [j6]Khaled Belahcène, Vincent Mousseau, Wassila Ouerdane, Marc Pirlot, Olivier Sobrie:
Multiple criteria sorting models and methods - Part I: survey of the literature. 4OR 21(1): 1-46 (2023) - [j5]Khaled Belahcène, Vincent Mousseau, Wassila Ouerdane, Marc Pirlot, Olivier Sobrie:
Multiple criteria sorting models and methods. Part II: theoretical results and general issues. 4OR 21(2): 181-204 (2023) - [j4]Khaled Belahcène, Vincent Mousseau, Wassila Ouerdane, Marc Pirlot, Olivier Sobrie:
Ranking with Multiple Reference Points: Efficient SAT-based learning procedures. Comput. Oper. Res. 150: 106054 (2023) - [c15]Hénoïk Willot, Sébastien Destercke, Khaled Belahcène:
Prime implicants as a versatile tool to explain robust classification. ISIPTA 2023: 461-471 - [c14]Khaled Belahcène, Jérome Gaigne, Sylvain Lagrue:
Opérateurs totalement informatifs et ordres linéaires partitionnés en révision de croyances. JIAF 2023: 43-54 - [c13]Manuel Amoussou, Khaled Belahcène, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
Des explications transitives questionnables au service de l'élicitation de préférences additives. JIAF 2023: 114-123 - [c12]Hénoïk Willot, Sébastien Destercke, Khaled Belahcène:
Les implicants premiers, un outil polyvalent pour l'explication de classification robuste. JIAF 2023: 146-155 - 2022
- [j3]Alexandru-Liviu Olteanu, Khaled Belahcène, Vincent Mousseau, Wassila Ouerdane, Antoine Rolland, Jun Zheng:
Preference elicitation for a ranking method based on multiple reference profiles. 4OR 20(1): 63-84 (2022) - [j2]Ali Tlili, Khaled Belahcène, Oumaima Khaled, Vincent Mousseau, Wassila Ouerdane:
Learning non-compensatory sorting models using efficient SAT/MaxSAT formulations. Eur. J. Oper. Res. 298(3): 979-1006 (2022) - [c11]Manuel Amoussou, Khaled Belahcène, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
Des explications par étapes pour le modèle additif. JIAF 2022: 23-34 - [c10]Khaled Belahcène, Jérome Gaigne, Sylvain Lagrue:
Fragment explicable par schémas d'arguments des affectations nécessaires dans un tri non compensatoire. JIAF 2022: 35-46 - [c9]Hénoïk Willot, Khaled Belahcène, Sébastien Destercke:
Explications de recommandations fondées sur des principes d'équité à l'aide de transferts. JIAF 2022: 47-48 - [c8]Hénoïk Willot, Sébastien Destercke, Khaled Belahcène:
Explications de classifications robustes à l'aide d'implicants premiers. LFA 2022 - [c7]Hénoïk Willot, Sébastien Destercke, Khaled Belahcène:
Explaining Robust Classification Through Prime Implicants. SUM 2022: 361-369 - 2021
- [c6]Khaled Belahcène, Vincent Mousseau, Anaëlle Wilczynski:
Combining Fairness and Optimality when Selecting and Allocating Projects. IJCAI 2021: 38-44 - 2020
- [c5]Khaled Belahcène, Nataliya Sokolovska, Yann Chevaleyre, Jean-Daniel Zucker:
Learning Interpretable Models using Soft Integrity Constraints. ACML 2020: 529-544 - [c4]Juliette Ortholand, Sébastien Destercke, Khaled Belahcène:
Equity in Learning Problems: An OWA Approach. SUM 2020: 187-199
2010 – 2019
- 2019
- [c3]Khaled Belahcène, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
Comparing Options with Argument Schemes Powered by Cancellation. IJCAI 2019: 1537-1543 - 2018
- [j1]Khaled Belahcène, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples. Comput. Oper. Res. 97: 58-71 (2018) - [c2]Khaled Belahcène, Yann Chevaleyre, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
Accountable Approval Sorting. IJCAI 2018: 70-76 - 2017
- [c1]Khaled Belahcène, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
A Model for Accountable Ordinal Sorting. IJCAI 2017: 814-820 - [i2]Khaled Belahcène, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples. CoRR abs/1710.10098 (2017) - 2015
- [i1]Khaled Belahcène, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane:
Explaining robust additive utility models by sequences of preference swaps. CoRR abs/1502.04593 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
