Construct · 1 fields · 1 citations

constraint satisfaction problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Theory of computation

a problem of assigning values to variables so that every stated constraint between them holds, with local consistency checks used to prune the search.

In theory of computation, constraint satisfaction problem refers to a problem of assigning values to variables so that every stated constraint between them holds, with local consistency checks used to prune the search. This meaning comes from Mackworth (1977) in Artificial Intelligence.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how constraint satisfaction problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

consistency4 fields · 5 citationsjingle · one word, four constructs CSP dichotomy theorem1 fields · 1 citationsanchor · a standalone construct intelligence6 fields · 14 citationsjingle · one name, six constructs

References

Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99-118. https://doi.org/10.1016/0004-3702(77)90007-8

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct