Social networks

External widget

GCC

global constraint catalog

  • web version
  • last version (Feb. 14, 2012, vol.1)
  • last version (Sep. 18, 2018, vol.2)
  • working version (Oct. 1, 2018, vol.1)
  • working version (Sep. 18, 2018, vol.2)

Production year

Number of documents

8

Nicolas Beldiceanu


Professor in computer science, IMT Atlantique, LS2N-CNRS, 2003-current (Nantes, France)

Research in constraint programming:

  •     global constraints and structural time-series constraints
  •     efficient filtering algorithms
  •     describing constraints (with meta data, graph, automata, transducers)
  •     synthesizing/learning combinatorial knowledge maps
  •     learning constraints models


Senior researcher at SICS, 1999-2003 (Uppsala Sweden)

In charge of research at COSYTEC, 1990-1999 (Paris area, France)

Researcher at European Computer-Industry Research Centre, 1988-1989 (Munich, Germany)


Education

University Pierre et Marie Curie, PhD in Computer Science, 1983-1988
(Programmeur d'Etude, Maîtrise, DEA systèmes informatiques, PhD thesis under supervision of Claude Girault:
A rule language and an inference engine based on constraints and actions: application to Petri nets)

University Pierre et Marie Curie, HDR, 2003
(Global constraints: algorithmic and declarative aspects)

 

Award

2017: ACP Award for Research Excellence in Constraint Programming (slides)


2012   

Conference papers6 documents

  • Nicolas Beldiceanu, Pierre Flener, Jean-Noël Monette, Justin Pearson, Helmut Simonis. Some Research Challenges and Remarks on CP. 18th International Conference on Principles and Practice of Constraint Programming (CP'12), Oct 2012, Quebec, Canada. ⟨hal-00754356⟩
  • Helmut Simonis, Nicolas Beldiceanu. A Model Seeker: Extracting Global Constraint Models From Positive Examples. First workshop on COmbining COnstraint solving with MIning and LEarning (CoCoMile'12), Aug 2012, Montpellier, France. ⟨hal-00754341⟩
  • Helmut Simonis, Nicolas Beldiceanu. Building global constraint models from positive examples. 21th International Symposium on Mathematical Programming (ISMP'12), Aug 2012, Berlin, Germany. ⟨hal-00754354⟩
  • Nicolas Beldiceanu, Mats Carlsson, Thierry Petit, Jean-Charles Régin. An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization. 20th European Conference on Artificial Intelligence (ECAI'12), Aug 2012, Montpellier, France. pp.145-150, ⟨10.3233/978-1-61499-098-7-145⟩. ⟨hal-00754079⟩
  • Nicolas Beldiceanu, Helmut Simonis. A Model Seeker: Extracting Global Constraint Models from Positive Examples. 18th International Conference on Principles and Practice of Constraint Programming (CP'12), Oct 2012, Quebec, Canada. pp.141-157, ⟨10.1007/978-3-642-33558-7_13⟩. ⟨hal-00754044⟩
  • Arnaud Letort, Nicolas Beldiceanu, Mats Carlsson. A Scalable Sweep Algorithm for the cumulative Constraint. 18th International Conference on Principles and Practice of Constraint Programming (CP'12), Oct 2012, Quebec, Canada. pp.439-454, ⟨10.1007/978-3-642-33558-7_33⟩. ⟨hal-00754043⟩

Directions of work or proceedings1 document

  • Nicolas Beldiceanu, Narendra Jussien, Eric Pinson. 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12). Springer Berlin Heidelberg, pp.408, 2012, 978-3-642-29827-1. ⟨10.1007/978-3-642-29828-8⟩. ⟨hal-00754042⟩

Reports1 document

  • Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson. On the Reification of Global Constraints. 2012. ⟨hal-00754039⟩