• Home
• Contact
• Blog

This page summarizes the run of the 1st MISC-live trial run of the MISC competition which was completed on 14 January 2010. You may find further information about the competition on the MiSC page, and more general information about the mancoosi project on our main page.

Rules

Two fixed optimization criterias are used in the current version of the competition. Both are lexicographic combinations of four simple integer valued utility functions of a solution:

• PARANOID: we want to answer the user request, minimizing the number of packages removed in the solution, and also the packages changed by the solution;

• TRENDY: we want to answer the user request, minimizing the number of packages removed in the solution, minimising the number of outdated packages in the solution, and minimizing the number of extra packages installed.

The exact definitions of the criteria can be found here. Note that these are the definitions used for the first MiSC runs, later runs and the official MISC competitions may use different rules.

Solvers are classified as

• SUCCESS a claimed solution that really is a solution
• FAIL the solver declares that he hasn't found a solution
• ABORT (timeout, segmentation fault, ...)
• NOTSOL a claimed solution, which in reality is *not* a solution to the problem

More detailed information relevant for this run:

• The exact rules
• Submission instructions

Participants

• apt-pbo: a modified apt tool using pseudo-boolean-optimization (minisat+ or wbo)
• inesc-udl: a SAT-based solver developed by INESC-ID using the p2cudf parser (from Eclipse) and the MaxSAT solver MSUnCore
• p2cudf: a family of solvers on top of the Eclipse Provisioning Platform p2, based on the SAT4J library.

  See here for full description and source code.

• unsa: a solver built using ILOG's CPLEX

Paranoid Track Summary

Trendy Track Summary

Detailed Results

• Paranoid Track
• Trendy Track