SweConsNet Workshop 2012 - including my presentation "Comparison of >= 14 CP systems - and counting"
SweConsNet Workshop 2012One of the greatest joy attending these workshops is to meet and talk to all the clever and nice CP guys in Sweden/Denmark/Norway. But of course, the talks are also very interesting and they yield much inspiration and/or thoughts. Here's the program (the page SweConsNet Workshop 2012 have links to most presentations):
- Mats Carlsson, SICS.
On the Reification of Global Constraints.
Joint Work with: Nicolas Beldiceanu (EMN, Nantes, France), Pierre Flener and Justin Pearson (Uppsala University).
- Federico Pecora: Constraint reasoning and motion planning in the SAUNA project (This is a joint talk with SAIS).
- Uwe Köckemann, Federico Pecora and Lars Karlsson. Towards Planning With Very Expressive Languages via Problem Decomposition Into Multiple CSPs (This is a joint talk with SAIS).
- Invited talk: Associate professor Rune Møller Jensen from the IT University of Copenhagen will talk about AI and CP methods for optimizing liner shipping operations. (This is a joint talk with SAIS).
- Krzysztof Kuchcinski, Lund University. Operation Scheduling, Binding and Data Routing for Run-Time Reconfigurable Architecture.
- Håkan Kjellerstrand. Comparison of >= 14 CP systems - and counting.
- Stefano Di Alesio, Simula School of Research and Innovation AS, Norway. Testing Deadline Misses for Real-Time Systems Using Constraint Optimization Techniques.
- SAIS Masters Thesis Award Winner Rodrigo Gumucio. (This is a joint talk with SAIS).
- Maria Andreina Francisco Rodriguez, Uppsala University.
Consistency of Automaton-Induced Constraint Decompositions.
Joint work with: 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).
- Mats Carlsson's talk about "On the Reification of Global Constraints" which will probably/hopefully have a deep impact on the CP field
- and Roberto Castañeda Lozano about "Code Generation is a Constraint Problem", both for the interesting problem and the excellent presentation.
My SweConsNet talk: "Comparison of >= 14 CP systems - and counting"My own talk at the workshop was Comparison of >= 14 CP systems - and counting (PowerPoint). The purpose of it was twofold:
- Point out that my models - and especially the page Common constraint programming problems - could be used to compare different CP systems since quite a few implements the same problem using the same ("as same as possible") approach. As of now there are:
- 276 problems that is implemented in >= 2 systems (in total 1260 implemented models)
- 73 problems in >= 6 systems
- 44 problems in >= 8 systems
- 15 problems in >= 10 systems
- Mention some strengths/weaknesses - or rather: my likes/dislikes - about these 14 tested systems, especially for a person learning the CP system or learning CP in general. One of my running theme is that the syntax for the most common things in modeling (e.g. the
Elementconstraint and reifications) should be as easy as possible. The links are to my model pages for each system:
- MiniZinc(888 models)
- JaCoP (18 models)
- Choco (20 models)
- Comet (166 models)
- Gecode (162 models)
- Gecode/R (29 models)
- ECLiPSe (176 models)
- Tailor/Essence' (29 models)
- SICStus Prolog (151 models)
- Zinc (39 models)
- JaCoP/Scala (38 models)
- Google or-tools/Python (203 models)
- Google or-tools/Java (36 models)
- Google or-tools/C# (122 models)
Note: This is kind of an extension of my SweConsNet Workshop 2009 talk where I presented my take on the then tested 6 CP systems. See Report from SweConsNet2009, including my presentation.