51. |
Constraint satisfaction problems on finite domains are typically solved using a form of ___________
|
||||||||
Answer:
Option (d) |
52. |
Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.
|
||||||||
Answer:
Option (b) |
53. |
Flexible Constraint Satisfaction Problems relax on _______
|
||||||||
Answer:
Option (a) |
54. |
Language/Languages used for programming Constraint Programming includes ____________
|
||||||||
Answer:
Option (a) |
55. |
Backtracking is based on ____________
|
||||||||
Answer:
Option (d) |
56. |
Constraint Propagation technique actually modifies the Constraint Satisfaction Problem problem.
|
||||
Answer:
Option (a) |
57. |
Which of the following algorithm is generally used Constraint Satisfaction Problem search algorithm?
|
||||||||
Answer:
Option (b) |
58. |
In a rule-based system, procedural domain knowledge is in the form of:
|
||||||||
Answer:
Option (a) |
59. |
A production rule consists of"
|
||||||||
Answer:
Option (c) |
60. |
The complete set of rules for defining the valid movements of an AI agent for changing the states", What does the above definition refer to?
|
||||||||
Answer:
Option (b) |