ACE, a generic constraint solver

Christophe Lecoutre
1/6/2023
cs.AI

No official code found. Best implementation: xcsp3team/ACE (39 stars, MIT, last commit 2026-04-13).

Abstract

Constraint Programming (CP) is a useful technology for modeling and solving combinatorial constrained problems. On the one hand, on can use a library like PyCSP3 for easily modeling problems arising in various application fields (e.g., scheduling, planning, data-mining, cryptography, bio-informatics, organic chemistry, etc.). Problem instances can then be directly generated from specific models and data. On the other hand, for solving instances (notably, represented in XCSP3 format), one can use a constraint solver like ACE, which is presented in this paper. ACE is an open-source constraint solver, developed in Java, which focuses on integer variables (including 0/1-Boolean variables), state-of-the-art table constraints, popular global constraints, search heuristics and (mono-criterion) optimization.

View on arXivView PDF

Code Implementations(1)

xcsp3team/ACECommunity100%
MIT

Constraint Solver ACE

399Java6 months agoMIT
constrained-optimizationconstraint-programmingconstraint-satisfaction-problemconstraint-solverconstraints+6 more

Similar Papers

Cite this paper

@article{lecoutre2023ace,
  title  = {ACE, a generic constraint solver},
  author = {Christophe Lecoutre},
  year   = {2023},
  eprint = {2302.05405},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.05405v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.05405.svg)](https://codeofpaper.com/paper/2302.05405)

Discussion