COMICS

Information

COMICS (for COmputing Minimal Incoherent sets of ConstraintS) is a C++ platform which deals with the problem of computing Minimal Unsatisfiable Cores (in short MUC). COMICS recognizes the XML format, XCSP2.0, used to represent CSP instances (see XCSP2.0: information and benchmarks). COMICS implements a lot of mecanism to improve the core extraction: preprocessing, transition constraint heuristics, ...
The relevant publication are:

• Eric Grégoire , Jean-Marie Lagniez and Bertrand Mazure "Questioning the Importance of WCORE-Like Minimization Steps in MUC-Finding Algorithms.", in 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'12), pages 923-930, november 2013.
• Éric GRÉGOIRE, Jean-marie LAGNIEZ, Bertrand MAZURE, "Boosting MUC extraction in unsatisfiable constraint networks", in Applied Intelligence, vol. 41, n° 4, pp. 1012-1023, 2014.

This web page contains:

• the runtime code of our solver COMICS under Linux OS (comics_linux64)

Here is how to use COMICS

Let BENCHMARK be a CSP instance, which must conform to the standard XCSP2.0 format.