PyCSP3: Modeling Combinatorial Constrained Problems in Python - Université d'Artois Access content directly
Reports (Technical Report) Year : 2021

PyCSP3: Modeling Combinatorial Constrained Problems in Python

Abstract

In this document, we introduce PyCSP$3$, a Python library that allows us to write models of combinatorial constrained problems in a declarative manner. Currently, with PyCSP$3$, you can write models of constraint satisfaction and optimization problems. More specifically, you can build CSP (Constraint Satisfaction Problem) and COP (Constraint Optimization Problem) models. Importantly, there is a complete separation between the modeling and solving phases: you write a model, you compile it (while providing some data) in order to generate an XCSP$3$ instance (file), and you solve that problem instance by means of a constraint solver. You can also directly pilot the solving procedure in PyCSP$3$, possibly conducting an incremental solving strategy. In this document, you will find all that you need to know about PyCSP$3$, with more than 50 illustrative models.

Dates and versions

hal-03701203 , version 1 (21-06-2022)

Identifiers

Cite

Christophe Lecoutre, Nicolas Szczepanski. PyCSP3: Modeling Combinatorial Constrained Problems in Python. [Technical Report] arXiv. 2021. ⟨hal-03701203⟩
93 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More