Best Paper Award

Salem Benferhat, Hadja Faiza Khellaf-Haned et Ismahane Zeddighai
« On the Decomposition of Min-based Possibilistic Influence Diagrams »
8th International Conference on Agents and Artificial Intelligence (ICAART'16)

Best Paper Award

Dragan Doder, Srdjan Vesic
« How to Decrease and Resolve Inconsistency of a Knowledge Base? »
7th International Conference on Agents and Artificial Intelligence (ICAART'15)

Best Theoretical AI Paper Award

E. Grégoire, J.-M. Lagniez, B. Mazure
« Questioning the Importance of WCORE-like Minimization Steps in MUC-finding Algorihtms »
25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’13).

Runner-up as Best Student Paper

S. Jabbour, B. Raddaoui
« Measuring inconsistency through minimal proofs »
12th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU’13).

Best Paper Award

G. Audemard, J.-M. Lagniez, B. Mazure, L. Saïs
« On freezeing and reactivating learnt clauses »
14th International Conference on Theory and Applications of Satisfiability Testing (SAT’11)

Nominated for Best Paper

J.-F. Condotta, C. Lecoutre
« A Class of df-consistencies for Qualitative Constraint Networks »
12th International Conference on the Principles of Knowledge Representation and Reasoning (KR’10).

Nominated for Best Paper Award

P. Everaere, S. Konieczny, P. Marquis
« The epistemic view of belief merging :can we track the truth ? »
19th European Conference on Artificial Intelligence (ECAI’10). (607 soumissions, 134 papiers acceptés, 7 papiers nominés).

Ramamoorthy Best Paper Award

Y. Hamadi, S.Jabbour, L. Saïs
« Learning for Dynamic Subsumption »
21st IEEE International Conference on Tools with Artificial Intelligence (ICTAI’09).

Runner-up as Best Paper

C. Lecoutre, O. Roussell
« Failed Value Consistencies for Constraint Satisfaction »
15th International Conference on Principles and Practice of Constraint Programming (CP’09).

Best Student Paper Award

S. Benferhat, K. Tabia
« Novel and anomalous behavior detection using Bayesian network classifiers »
International Conference on Security and Cryptography (SECRYPT’08).

Distinguished Paper

C. Lecoutre, S. Cardon, J. Vion
« Conservative Dual Consistency »
22nd International Conference on Artificial Intelligence (AAAI’07).

Ray Reiter Award

S. Coste-Marquis, J. Lang, P. Liberatore, P. Marquis
« Expressive Power and Succinctness of Propositional Languages for Preference Representation »
9th International Conference on Principles of Knowledge Representation and Reasoning (KR’04).

Best Paper Award

A. Darwiche, P. Marquis
« A Knowledge Compilation Map »
Journal of Artificial Intelligence Research volume 17, 2002.

Best student paper award

Gaël Glorian
« Combinaison de nogoods extraits au redémarrage »
Treizièmes Journées Francophones de Programmation par Contraintes.

Best thesis in Artificial Intelligence (ex-aequo)

Eric Piette
« A Stochastic Constraint-Based Approach to General Game Playing »
Association Française pour l'Intelligence Artificielle.

Best student paper and presentation award

Eric Piette
Stochastic constraint programming for General Game Playing with incomplete information
Douzièmes Journées Francophones de Programmation par Contraintes (JFPC)

Best paper award

P. Besnard, É. Grégoire, C. Piette, B. Raddaoui
« Génération d’arguments et contre-arguments par calcul de MUS »
10e Rencontres des Jeunes Chercheurs en Intelligence Artificielle (AFIA/RJCIA’11).

Prix du meilleur papier en intelligence artificielle

S. Konieczny, J. Lang, P. Marquis
« Raisonnement en présence d’incohérence : le connecteur oublié »
14e Congrès AFRIF-AFIA Reconnaissance des Formes et Intelligence Artificielle (RFIA’04).

Prix du meilleur papier en intelligence artificielle

S. Coste-Marquis, H. Fargier, J . Lang, D. Le Berre, P. Marquis
« Résolution de formules booléennes quantifiées : problèmes et algorithmes »
13e Congrès AFRIF-AFIA Reconnaissance des Formes et Intelligence Artificielle (RFIA’02).

  • Woodstock won the General Game Playing 2016 international competition.
  • CoQuiAAS got the first place of the first International Competition on Computational Models of Argumentation (ICCMA).
  • Ppfolio got 16 medals during the SAT’11 competition.
  • Glucose got 9 medals (4 gold medals, 3 silver medals and 2 bronze medals) during solvers international competitions SAT’09, SAT’11 and SAT’13
  • ManySat:
    • one silver medal and one bronze medal got at the Sat Race 2010,
    • received a Special Jury Award in competition SAT 2009,
    • winner of the Sat Race 2008 in the parallel search track.
  • LySat got 2 bronze medals at SAT'09 international competition
  • The solver PENELOPE was ranked second in category "applications - UNSAT instances and second in category "applications - SAT+UNSAT instances" at SAT’09.
  • PRESAT was designated as the best solver (qualifiers) and sixth during the finals, "sequential track", of SAT-Race’08.
  • Abscon 109 was ranked first in category "non-binary extension constraints", second in categories "non-binary intension constraints" and "global constraints", and third in category "binary intension constraints". Most robust solver of CSP'06 internation competition (the one that solved the most instances).
  • ValCSP was ranked first in category "binary extension constraints" in competition CSP’06.