The set of values permitted for a variable Xi in a constraint satisfaction problem. All assignments before relational constraints form the Cartesian product ∏iDi, whose cardinality is ∏i∣Di∣ for finite domains. Unary restrictions can be incorporated directly into the constraint domain by deleting forbidden values.
Ancestors (7)
- Constraint satisfaction problem
- Search problem
- Computational problem
- Computational complexity theory
- Theoretical computer science
- Computer science
- Home
Incoming links (35)
- AC-3
- Arc-consistency closure
- Backtracking leaf bound
- Constraint domain
- Constraint graph
- CS 188 constraint ordering and structure notes
- Cutset conditioning
- Cycle cutset
- Direct SAT encoding of finite-domain constraints
- Full-sweep arc consistency
- Hill climbing
- Nonattacking knights problem
- No-waste allocation
- Past exam of the computer science course of the University of Oxford / 2019 / Artificial intelligence / 2 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2019 / Artificial intelligence / 2 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2020 / Artificial intelligence / 2 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2020 / Artificial intelligence / 2 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2020 / Artificial intelligence / 2 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2020 / Artificial intelligence / 2 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2020 / Artificial intelligence / 2 / e / Solution
- Past exam of the computer science course of the University of Oxford / 2021 / Artificial intelligence / 2 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2021 / Artificial intelligence / 2 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2021 / Artificial intelligence / 2 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2022 / Artificial intelligence / 3 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2022 / Artificial intelligence / 3 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2022 / Artificial intelligence / 3 / e / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Artificial intelligence / 3 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Artificial intelligence / 3 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Artificial intelligence / 3 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Artificial intelligence / 3 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Artificial intelligence / 3 / e / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Artificial intelligence / 3 / f / Solution
- Queens completion problem
- Tree-structured constraint satisfaction
- Unary constraint
Discussion (0)
New discussionThere are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.