Constraint Model
ConceptA constraint model is a formal specification of a constraint satisfaction problem (CSP), consisting of constraint variables with associated domains, a set of constraints that restrict assignments of those variables, and an invocation of a solver to find solutions. Constraint models can be constructed manually, refined automatically from abstract specification languages such as Essence, or generated with the aid of large language models combined with iterative solver-based verification.
First seen 7/7/2026
Last seen 7/7/2026
Evidence 4 chunks
Wiki v1
WIKI
Constraint Model
Definition and Structure
A constraint model is the formal representation of a constraint satisfaction problem (CSP). In concrete terms, a constraint model defines:
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →CITATIONS
13 sources13 citations — click to expand
[1] A constraint model defines constraint variables with appropriate variable domains, constraints posted (e.g., via `post`), and a call to a constraint solver to generate solutions consistent with the posted constraints. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[2] Correct constraint models can be generated with the help of an LLM by combining their verification with constraint solvers in an iterative loop. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[3] The verification method ensures complete (global) consistency and, in the case of the TSP, optimality of the resulting constraint model. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[4] Generated models are expressed in Python using the PyChoco API, requiring the LLM to produce syntactically correct Python code that uses Choco's modeling primitives. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[5] The verification method requires concrete constraints of a constraint problem, a test method for checking these restrictions of the CSP in general, and explanations as output if errors occur for guiding the LLM to a solution. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[6] Inputs to LLM-based model generation can include a commonly known CSP name, a natural-language description of restrictions (such as the Zebra Puzzle), or a general description of an abstract problem with a concrete task instance. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[7] Constraint solvers implement specific efficient algorithms that are general and work on descriptive models, but these algorithms must be invoked via the solver's library API. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[8] Constraint models were successfully generated and verified for N-Queen (N=8), Magic Square, Map Coloring, and TSP; for Map Coloring and Magic Square a single iteration was sufficient. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[9] The test-driven LLM approach is positioned as particularly suitable for small to medium-sized CSPs or as a prototyping tool, with scalability to industrial-size configuration tasks remaining open. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[10] Many real-world problems can be defined as CSPs requiring knowledge engineers to translate domain-specific constraints into formal representations; this modelling process is often complex and labor-intensive. Test-driven Generation of Constraint Satisfaction Problems Using Large Language Models
[11] Automating the constraint modelling process is one of the key challenges facing the constraints field and one of the principal obstacles preventing widespread adoption of constraint solving. Conjure Revisited: Towards Automated Constraint Modelling
[12] In the refinement-based approach, a user specifies a problem in an abstract constraint specification language and it is then automatically refined into a constraint model; Conjure implements this for the Essence specification language. Conjure Revisited: Towards Automated Constraint Modelling
[13] Constraint modelling has been integrated with relational DBMSs by extending relational algebra and SQL with a guessing operator, yielding non-deterministic extensions able to express all problems in NP (with syntactical restrictions yielding polynomial data complexity). Combining Relational Algebra, SQL, Constraint Modelling, and Local Search