In constraint satisfaction problem, constraints can be stated as __________ .
2015
In constraint satisfaction problem, constraints can be stated as __________ .
- A.
Arithmetic equations and inequalities that bind the values of variables
- B.
Arithmetic equations and inequalities that does not bind any restriction over variables
- C.
Arithmetic equations that impose restrictions over variables
- D.
Arithmetic equations that discard constraints over the given variables
Attempted by 66 students.
Show answer & explanation
Correct answer: A
Answer: Constraints are commonly expressed as arithmetic equations and inequalities that bind the values of variables.
Explanation: Constraints restrict which assignments to variables are allowed by specifying relations between variables. Writing constraints as equations or inequalities directly limits the set of valid assignments.
Example: x + y = 10 — only pairs (x, y) whose sum is 10 satisfy this constraint.
Example: x - y ≥ 2 — an inequality restricting the relative values of x and y.
Effect: Equations and inequalities reduce the search space by excluding assignments that do not satisfy the relations.
Note: Beyond arithmetic relations, constraints can also be logical or non-numeric relations depending on the problem domain, but the given correct choice captures the common formulation using equations and inequalities.