Author of the publication

Les raisons majoritaires : des explications abductives pour les forêts aléatoires.

, , , , , and . EGC, volume E-38 of RNTI, page 123-134. Editions RNTI, (2022)

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 SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem., , , , and . AAAI, page 3864-3870. AAAI Press, (2017)Preprocessing for Propositional Model Counting., and . AAAI, page 2688-2694. AAAI Press, (2014)Trading Complexity for Sparsity in Random Forest Explanations., , , , , and . AAAI, page 5461-5469. AAAI Press, (2022)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)Defining and Evaluating Heuristics for the Compilation of Constraint Networks., , and . CP, volume 10416 of Lecture Notes in Computer Science, page 172-188. Springer, (2017)Factoring Out Assumptions to Speed Up MUS Extraction., and . SAT, volume 7962 of Lecture Notes in Computer Science, page 276-292. Springer, (2013)On Computing One Max_Subset Inclusion Consensus., , and . ICTAI, page 838-845. IEEE Computer Society, (2017)Dynamic Polarity Adjustment in a Parallel SAT Solver., and . ICTAI, page 67-73. IEEE Computer Society, (2011)Learning Model Agnostic Explanations via Constraint Programming., , , and . ECML/PKDD (4), volume 14944 of Lecture Notes in Computer Science, page 437-453. Springer, (2024)Boosting Definability Bipartition Computation Using SAT Witnesses., and . JELIA, volume 14281 of Lecture Notes in Computer Science, page 697-711. Springer, (2023)