Metraipolis › archive › dc_2a9cc3a3dad7

Constraint programming — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Constraint_programming
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T23:14:35.586Z
SHA-256 of the archived text
64715da01f53259349f339595d826f690a2448b927e406cca0a9c3bdf8e1133d
Stable URL of this page
https://metraipolis.com/documento/dc_2a9cc3a3dad7

How to cite

Constraint programming — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Constraint_programming (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_2a9cc3a3dad7 (Metraipolis archive dc_2a9cc3a3dad7, sha256 64715da01f53259349f339595d826f690a2448b927e406cca0a9c3bdf8e1133d)
BibTeX
@misc{dc2a9cc3a3dad7,
  title = {Constraint programming — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Constraint_programming},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_2a9cc3a3dad7; sha256 64715da01f53259349f339595d826f690a2448b927e406cca0a9c3bdf8e1133d},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Constraint_programming. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer science, and operations research. In constraint programming, users declaratively state the constraints on the feasible solutions for a set of decision variables. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found. In addition to constraints, users also need to specify a method to solve these constraints. This typically draws upon standard methods like chronological backtracking and constraint propagation, but may use customized code like a problem-specific branching heuristic. Constraint programming takes its root from and can be expressed in the form of constraint logic programming, which embeds constraints into a logic program. This variant of logic programming is due to Jaffar and Lassez, who extended in 1987 a specific class of constraints that were introduced in Prolog II. The first implementations of constraint logic programming were Prolog III, CLP(R), and CHIP. Instead of logic programming, constraints can be mixed with functional programming, term rewriting, and imperative languages. Programming languages with built-in support for constraints include Oz (functional programming) and Kaleidoscope (imperative programming). Mostly, constraints are implemented in imperative languages via constraint solving toolkits, which are separate libraries for an existing imperative language.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»).
Fonte: Wikipedia in inglese, voce «Constraint programming» — https://en.wikipedia.org/wiki/Constraint_programming
Wikidata Q528588 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q528588
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Constraint_programming?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1369233996, consultata il 2026-10-07T22:53:13.217Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a8729e77a36cf42e0fc7925d6b084efec30c3f0a9dd5f3e619e50145284ac07e