Practical Application of Matchmaking Problem: Trainee Allocation for Teachers

International audienceIn this paper, we tackle a complex real-world problem: trainee allocation for primary school teachers in a French teaching Academy. This complex real-world problem can be reduced into the well- known Hospitals / Residents (HR) problem. However, the most difficult part consists of generating the preference lists according to the real con- straints, priorities and wishes. Additionally, we adapt the Swing method to the HR problem and we apply it to this real-world problem in order to balance the different objectives. In this way, the Swing method decreases the management cost of the operation

Une nouvelle méthode hybride pour calculer tous les MSS et tous les MUS

Dans ce papier, nous présentons une nouvelle technique complète permettant le calcul des sous-formules maximales consistantes (MSS) et des formules minimales inconsistantes (MUS) d'un ensemble de clauses booléennes. Cette approche améliore la meilleure technique complète connue de plusieurs manières. Elle utilise à la fois une recherche locale peu coûteuse en ressources et le nouveau concept de clause critique pour améliorer un algorithme complet proposé par Liffiton et Sakallah. Cette hybridation permet l'obtention de gains exponentiels. Ainsi, des résultats expérimentaux montrent que cette nouvelle approche dépasse la meilleure méthode proposée jusque ici

Extraction de sous-formules minimales inconsistantes

Une sous-formule minimale inconsistante (Minimally Unsatisfiable Subformula ou MUS en anglais) représente la plus petite cause d'incohérence d'une instance SAT en terme de nombre de clauses. Extraire un ou plusieurs MUS s'avère donc très utile, car ceux-ci circonscrivent les sources d'inconsistance d'une formule CNF. Dans ce papier, une nouvelle méta-heuristique permettant l'approximation ou le calcul d'un MUS est présentée. Une comparaison avec les méthodes les plus compétitives est effectuée, et montre que le plus souvent, en pratique, cette approche surpasse les résultats obtenus par les autres méthodes existantes

Localiser des sources d'incohérence spécifiques sans les calculer toutes

International audienceNon disponibl

On Finding Minimally Unsatisfiable Cores of CSPs

International audienceWhen a Constraint Satisfaction Problem (CSP) admits no solution, it can be useful to pinpoint which constraints are actually contradicting one another and make the problem infeasible. In this paper, a recent heuristic-based approach to compute infeasible min- imal subparts of discrete CSPs, also called Minimally Unsatisfiable Cores (MUCs), is improved. The approach is based on the heuristic exploitation of the number of times each constraint has been falsified during previous failed search steps. It appears to en- hance the performance of the initial technique, which was the most efficient one until now

Practical Application of Matchmaking Problem : Trainee Allocation for Teachers

In this paper, we tackle a complex real-world problem: trainee allocation for primary school teachers in a French teaching Academy. In this real-world problem, the most difficult part consists of generating the preference lists according to the constraints, priorities and wishes in order to reduce this problem into the well-known Hospitals / Residents (HR) problem. Additionally, when we apply the existing algorithm for solving this problem we favorite one community or another. In this paper, we adapt the Swing method to the HR problem and we apply it to this real-world problem in order to balance the different objectives. In this way, the Swing method decreases the management cost of the operation

General Game Playing with Stochastic CSP

selected for Journal Publication Fast Track in CP'15International audienc

A Practical introduction to the Ludii General Game System

Ludii is a new general game system, currently under development, which aims to support a wider range of games than existing systems and approaches. It is being developed primarily for the task of game design, but o↵ers a number of other potential benefits for game and AI researchers, professionals and hobbyists. This paper is based on an interactive demonstration of Ludii at thuis year’s Advances in Computer Games conference (ACG 2019). It describes the approach behind Ludii, how it works, how it is used, and what it can potentially do