My Constraint Programming Blog

From the announcement of SweConsNet'12 - The Eleventh SweConsNet Workshop:

SweConsNet is the Network for Sweden-based researchers and practitioners of Constraint technology.

Following the previous successful workshops, we would like to announce the 11th SweConsNet workshop, which will take place in Örebro, Sweden on May 14th 2012. The workshop is organized in collocation with the 27th annual workshop of the Swedish Artificial Intelligence Society (SAIS).

The purpose of this workshop is to learn about ongoing research in constraint programming, as well as existing projects and products. We will also discuss the further development of the network, such as a possible widening to other Nordic countries.

The workshop is open to everybody interested in the theory and practice of constraint programming, whether based in Sweden or elsewhere. The scope of the workshop spans all areas of Constraint Programming, and is open to presentations and discussions addressing topics related to both theory and application.

Please forward a link of this page to people who might be interested but are not yet on the SweConsNet mailing list. They can subscribe to it by sending a message to Justin.Pearson at it.uu.se .

We hope for your participation, and highly encourage you to submit a proposal for a presentation of your ongoing work, recent results, or of a relevant discussion topic. There are no paper submissions, reviews, or proceedings, hence recent conference/journal papers may also be presented.

To register, please send a brief statement of intent, and desirably the title and abstract of your talk, to Christian Schulte (cschulte at kth.se). In order to facilitate organization, please notify us of your intention to participate as soon as possible, and at the latest before April 30th, 2012. The workshop does not have a registration fee.

Preliminary list of speakers

• Mats Carlsson, SICS. On the Reification of Global Constraints. Joint Work with: Nicolas Beldiceanu (EMN, Nantes, France), Pierre Flener and Justin Pearson (Uppsala University).
• Roberto Castañeda Lozano, SICS & KTH - ICT. Code Generation is a Constraint Problem. Joint work with: Mats Carlsson (SICS), Frej Drejhammar (SICS), Christian Schulte (KTH - ICT, SICS).
• Maria Andreina Francisco Rodriguez, Uppsala University. Consistency of Automaton-Induced Constraint Decompositions. Joint work with: Pierre Flener and Justin Pearson (Uppsala University).
• Håkan Kjellerstrand. Comparison of >= 14 CP systems - and counting.
• Krzysztof Kuchcinski, Lund University. TBD.
• Federico Pecora, Örebro University. Constraint-based methods for multiple non-holonomic vehicle scheduling and control.

As you see, I plan to compare different CP systems, which will be the systems listed in Common CP Problems. Perhaps also some not yet on that list, candidates are Numberjack, JSR-331, and Scampi.

For a taste of earlier workshops, see SweConsNet:Workshops, and general information about SweConsNet.