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 doesn’t bind any restriction over variables
(C) Arithmetic equations that impose restrictions over variables
(D) Arithmetic equations that discard constraints over the given variables
Answer: (A)
Explanation: In constraint satisfaction problem, constraints can be stated as arithmetic equations and inequalities that bind the values of variables and these are mathematical problem defined as a set of objects whose state must satisfy a number of constraints or limitations.
So, option (A) is correct.
Quiz of this Question
UGC-NET | UGC NET CS 2015 Dec – III | Question 47
Article Tags :
Recommended Articles