XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

by   Frederic Boussemart, et al.

We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated representations of combinatorial constrained problems. This new format is able to deal with mono/multi optimization, many types of variables, cost functions, reification, views, annotations, variable quantification, distributed, probabilistic and qualitative reasoning. The new format is made compact, highly readable, and rather easy to parse. Interestingly, it captures the structure of the problem models, through the possibilities of declaring arrays of variables, and identifying syntactic and semantic groups of constraints. The number of constraints is kept under control by introducing a limited set of basic constraint forms, and producing almost automatically some of their variations through lifting, restriction, sliding, logical combination and relaxation mechanisms. As a result, XCSP3 encompasses practically all constraints that can be found in major constraint solvers developed by the CP community. A website, which is developed conjointly with the format, contains many models and series of instances. The user can make sophisticated queries for selecting instances from very precise criteria. The objective of XCSP3 is to ease the effort required to test and compare different algorithms by providing a common test-bed of combinatorial constrained instances.


page 14

page 16

page 17

page 18

page 29

page 34

page 38

page 40


Constrained locating arrays for combinatorial interaction testing

This paper introduces the notion of Constrained Locating Arrays (CLAs), ...

Handling Constraints in Combinatorial Interaction Testing in the presence of Multi Objective Particle Swarm and Multithreading

Context: Combinatorial testing strategies have lately received a lot of ...

Unshuffling fields in data formats

Data format reverse engineering commonly involves identifying conserved ...

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

In this document, we introduce XCSP3-core, a subset of XCSP3 that allows...

Testing Global Constraints

Every Constraint Programming (CP) solver exposes a library of constraint...

A Combined Approach for Constraints over Finite Domains and Arrays

Arrays are ubiquitous in the context of software verification. However, ...

Please sign up or login with your details

Forgot password? Click here to reset