Constraint Programming (CP) is a powerful paradigm for solving complex combinatorial problems across a wide range of domains.
Over the years, many solvers and tools have been developed, but their interoperability remains limited.
TOOTATIS addresses this challenge by offering a modular ecosystem that fosters integration, experimentation, and ease of use across different solvers, formats, and languages.
Initially centered around the Universe library, TOOTATIS has evolved to encompass a broader collection of complementary tools for modeling, solving, and analyzing constraint-based problems.
Our toolset includes solutions for:
- 📦 Solver installation and management
- 📊 Experimentation and performance analysis
- 🛠️ Solver configuration standardization
- 🔗 Integration with modern development environments (e.g., VSCode)
📚 Main Projects
🗂️ Configuration & Metadata
- metrics-solvers — Predefined solver configurations ready for experimentation with metrics and xcsp-launcher.
- xcsp-metadata — Repository of instance metadata for the XCSP3 format.
🛠️ Tools
- xcsp-launcher — Unified installer, builder, and launcher for XCSP3-compatible solvers.
🌌 Universe — mUlti laNguage unIfied intErface foR conStraint solvErs
A multi-language library providing generic interfaces to interact with combinatorial problem solvers.
- Universe (C++) — Unified C++ API for constraint programming solvers.
- Juniverse (Java) — Java unified interface for solvers.
- CSUniverse (C#) — C# implementation of the Universe API.
🧩 Parsing
- Autis — A library for parsing combinatorial problems.
⚡ Parallel Solving
- Panoramyx — A C++ framework for solving constraint programming problems in parallel.
(Built on top of the Universe C++ library.)