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

09/01/2020
by   Frederic Boussemart, et al.
4

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.

READ FULL TEXT

page 11

page 12

page 13

page 26

page 28

page 31

page 39

page 40

research
09/01/2020

PYCSP3: Modeling Combinatorial Constrained Problems in Python

In this document, we introduce PYCSP3, a Python library that allows us t...
research
05/08/2013

Unsatisfiable Cores for Constraint Programming

Constraint Programming (CP) solvers typically tackle optimization proble...
research
08/25/2015

Unsatisfiable Cores and Lower Bounding for Constraint Programming

Constraint Programming (CP) solvers typically tackle optimization proble...
research
10/05/2021

Optimization with Constraint Learning: A Framework and Survey

Many real-life optimization problems frequently contain one or more cons...
research
11/10/2016

XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

We propose a major revision of the format XCSP 2.1, called XCSP3, to bui...
research
08/16/2019

The Regularization of Small Sub-Constraint Satisfaction Problems

This paper describes a new approach on optimization of constraint satisf...
research
02/15/2019

Privacy of Existence of Secrets: Introducing Steganographic DCOPs and Revisiting DCOP Frameworks

Here we identify a type of privacy concern in Distributed Constraint Opt...

Please sign up or login with your details

Forgot password? Click here to reset