( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Enforcing Solutions in Constraint Networks.

, , и . ECAI, том 263 из Frontiers in Artificial Intelligence and Applications, стр. 1017-1018. IOS Press, (2014)

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.

Jean-Marie Jungblut

Jean-Marie Babo

Jean-Marie Renno

Jean-Marie Kengne

Jean-Marie Yante

 

Другие публикации лиц с тем же именем

Factoring Out Assumptions to Speed Up MUS Extraction., и . SAT, том 7962 из Lecture Notes in Computer Science, стр. 276-292. Springer, (2013)Defining and Evaluating Heuristics for the Compilation of Constraint Networks., , и . CP, том 10416 из Lecture Notes in Computer Science, стр. 172-188. Springer, (2017)Améliorer SAT dans le cadre incrémental., , , и . Rev. d'Intelligence Artif., 28 (5): 593-614 (2014)Definability for model counting., , и . Artif. Intell., (2020)Trading Complexity for Sparsity in Random Forest Explanations., , , , , и . AAAI, стр. 5461-5469. AAAI Press, (2022)A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem., , , , и . AAAI, стр. 3864-3870. AAAI Press, (2017)Preprocessing for Propositional Model Counting., и . AAAI, стр. 2688-2694. AAAI Press, (2014)Introducing the Fourth International Competition on Computational Models of Argumentation., , , и . SAFA@COMMA, том 2672 из CEUR Workshop Proceedings, стр. 80-85. CEUR-WS.org, (2020)On Computing One Max_Subset Inclusion Consensus., , и . ICTAI, стр. 838-845. IEEE Computer Society, (2017)Dynamic Polarity Adjustment in a Parallel SAT Solver., и . ICTAI, стр. 67-73. IEEE Computer Society, (2011)