constraint satisfaction problem; CSP
Technical term in artificial intelligence and computer science. Refers to a mathematical problem where a set of variables must satisfy given constraints.
Constraint satisfaction problems are often studied in the field of AI.
This scheduling problem can be formulated as a constraint satisfaction problem.
Compound of 制約 (constraint), 充足 (satisfaction), and 問題 (problem). A direct translation of the English term 'constraint satisfaction problem'.