AISep 1, 2020

XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems

arXiv:2009.00514v412 citations
AI Analysis

This work provides a standardized format for constraint solver competitions, which is incremental as it builds upon the existing XCSP3 framework.

The authors introduced XCSP3-core, a subset of XCSP3 for representing constraint satisfaction/optimization problems, focusing on popular frameworks and constraints to facilitate parsing and enable standardized comparisons in solver competitions.

In this document, we introduce XCSP3-core, a subset of XCSP3 that allows us to represent constraint satisfaction/optimization problems. The interest of XCSP3-core is multiple: (i) focusing on the most popular frameworks (CSP and COP) and constraints, (ii) facilitating the parsing process by means of dedicated XCSP3-core parsers written in Java and C++ (using callback functions), (iii) and defining a core format for comparisons (competitions) of constraint solvers.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes