Constraint Satisfaction Problem
A mathematical problem consisting of variables, domains, and constraints, whose goal is to find an assignment of variables that satisfies all constraints simultaneously. In graph generation it is used to encode topological constraints as a solvable, complete constraint system.
Timeline (last 90 days)
The global constraint satisfaction method reformulates the generation problem as a constraint satisfaction problem (CSP) and designs a complete encoding that can be solved by modern constraint programming solvers.
LEGO building is naturally a constraint satisfaction problem, in which the position and orientation of each brick are variables, the interlocking rules, non-overlap, connectivity, and so on constitute constraints, and it also includes soft constraints such as aesthetics and proportional harmony.
Constraint satisfaction problems (CSP) are the mathematical foundation of logic games.
The Minimal Unsatisfiable Subset (MUS) is a core concept in constraint satisfaction problems, referring to the smallest subset of an unsatisfiable constraint set such that removing any single constraint makes the whole set satisfiable; finding all MUSes and providing the optimal deletion plan is inherently NP-hard combinatorial optimization.
Reverse ingredient recommendation is essentially a Constraint Satisfaction Problem.
应将终态描述当作约束条件（constraints）而非视觉建议，约束条件是可验证的
All Facts (6)
The global constraint satisfaction method reformulates the generation problem as a constraint satisfaction problem (CSP) and designs a complete encoding that can be solved by modern constraint programming solvers.
50%UnverifiedLEGO building is naturally a constraint satisfaction problem, in which the position and orientation of each brick are variables, the interlocking rules, non-overlap, connectivity, and so on constitute constraints, and it also includes soft constraints such as aesthetics and proportional harmony.
50%UnverifiedConstraint satisfaction problems (CSP) are the mathematical foundation of logic games.
50%UnverifiedThe Minimal Unsatisfiable Subset (MUS) is a core concept in constraint satisfaction problems, referring to the smallest subset of an unsatisfiable constraint set such that removing any single constraint makes the whole set satisfiable; finding all MUSes and providing the optimal deletion plan is inherently NP-hard combinatorial optimization.
50%UnverifiedReverse ingredient recommendation is essentially a Constraint Satisfaction Problem.
50%Unverified应将终态描述当作约束条件（constraints）而非视觉建议，约束条件是可验证的
50%