mlsanityData to 7 Oct 2026

ACE, a generic constraint solver

arXiv 2302.05405 ↗First posted 6 Jan 2023cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 5 of its 37 references that are in the map. First posted on arXiv 6 Jan 2023.

Builds on

5 of 37 references.

References · 5

  1. 2020PyCSP3: Modeling Combinatorial Constrained Problems in Pythoncited by 9
  2. 2016XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problemscited by 7
  3. 2020XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problemscited by 7
  4. 2016Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Setscited by 6
  5. 2022Proceedings of the 2022 XCSP3 Competitioncited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 2.

3 papers.