Presentation

The TASC research team

TASC -- Theory, Algorithms, and Systems for Constraints -- is a joint team of the INRIA's research center of Rennes and of the CNRS's computer science laboratory of Nantes-Atlantique (LINA). It gathers about 20 teachers/researchers from the École des Mines de Nantes and from Nantes University, working in the area of constraint programming.

This website presents the objectives and productions of the team:

• the scientific project: a description of the themes and specific research orientations
• the list of publications
• research projects carried out with other academic institutions and industrial partnerships
• resources, softwares, communication material, of which:

News

may 28-june 1, 2012, Nantes:

The TASC team and the LigéRO group organize CPAIOR'2012. Conference chair: Narendra Jussien and Thierry Petit; Program chair: Narendra Jussien, Nicolas Beldiceanu and Éric Pinson

july 2011:

6 new papers to appear in conference CP'2011 including the best student paper for Marie Pelleau et al. Octagonal Domains for Continuous Constraints

april 2011:

Creation of the TASC team-project of INRIA Rennes; the Constraints team is renamed TASC

april 2011:

The global constraint seeker is now online

Contact us

Please feel free to contact us with any questions, comments, or other inquiries you have.

head

Professor Nicolas Beldiceanu, Nicolas.Beldiceanu@mines-nantes.fr, tel: +33 (0)2 51 85 82 42

vice head

Associate professor Thierry Petit, Thierry.Petit@mines-nantes.fr, tel: +33 (0)2 51 85 82 08

assistant

Catherine Fourny, tel: +33 (0)2 51 85 82 12, fax: +33 (0)2 51 85 82 49

postal mail

École des Mines de Nantes
Équipe Contraintes - Département Informatique
4 rue Alfred Kastler, BP 20722
44307 Nantes Cedex 03, France

Last publications

• Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem (2013).
  Jean-Guillaume Fages Tanguy Lapègue 19th International Conference on Principles and Practice of Constraint Programming (CP'13), best student paper, Lectures Notes in Computer Science 8124
• Prediction of Parallel Speed-ups for Las Vegas Algorithms (2013).
  Charlotte Truchet Florian Richoux Philippe Codognet 2013 International Conference on Parallel Processing (ICPP'13),
• Propagation Engine Prototyping with a Domain Specific Language (2013).
  Charles Prud'homme Xavier Lorca Rémi Douence Narendra Jussien Constraints, to appear
• Three Generalizations of the FOCUS Constraint (2013).
  Nina Narodytska Thierry Petit Mohamed Siala Toby Walsh IJCAI, 23rd International Joint Conference on Artificial Intelligence,
• Asynchronous Forward Bounding Revisited (2013).
  Mohamed Wahbi Redouane Ezzahir Christian Bessiere 19th International Conference on Principles and Practice of Constraint Programming (CP'13), Uppsala, Sweden. Lecture Notes in Computer Science: 708--723.
• Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems (2013). [url]
  Mohamed Wahbi Wiley-ISTE, ISBN 978-1-84821-594-8.
• Nogood-based asynchronous forward checking algorithms (2013). [doi] [url]
  Mohamed Wahbi Redouane Ezzahir Christian Bessiere ElHoussine Bouyakhf Constraints 18(3): 404--433.
• Maintien asynchrone de la consistance d'arc dans la recherche distribuée synchrone (2013).
  Mohamed Wahbi Redouane Ezzahir Christian Bessiere ElHoussine Bouyakhf 9ème Journées Francophones de Programmation par Contraintes, Aix-en-Provence, France. pp. 347--356.
• Une approche basée sur les contraintes pour résoudre le problème d?arbre recouvrant de coût minimum avec contraintes de degré (2013).
  Jean-Guillaume Fages Xavier Lorca Louis-Martin Rousseau 9 emes Journées Francophones de Programmation par Contraintes (JFPC'13), Aix-en-Provence, France. pp. 119-122.
• Prototyper des Moteurs de Propagation avec un DSL (2013).
  Charles Prud'homme Xavier Lorca Rémi Douence Narendra Jussien 9èmes Journées Francophones de Programmation par Contraintes(JFPC'13),
• La recherche locale pour la pr\'{e}-programmation d'environnements urbains durables (2013). [paper]
  Bruno Belin Marc Christie Charlotte Truchet Actes JFPC 2013,
• When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent (2013).
  Jérémie Du Boisberranger Danièle Gardy Xavier Lorca Charlotte Truchet Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics (ANALCO2013), New Orleans, Louisiana, USA. pp. 80-90.
• A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint (2013).
  Arnaud Letort Mats Carlsson Nicolas Beldiceanu Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference (CPAIOR'13), Yorktown Heights, NY, USA. Lecture Notes in Computer Science 7874: 144-159.
• GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials (2013).
  Naina Razakarison Nicolas Beldiceanu Mats Carlsson Helmut Simonis The Sixth Annual Symposium on Combinatorial Search (SOCS'13), Leavenworth, WA, USA.