Discussion
Consider the following pairings in constraint satisfaction.
Forward checking - prunes neighbours of the assigned variable
Arc consistency - prunes values with no support in a neighbour
Backjumping - returns to a variable in the conflict set
Min conflicts - systematic search over partial assignments
How many of the pairs given above are correctly matched?
Answer: C
The first three are correct. Min conflicts is a local search operating on complete assignments, repairing violations, rather than a systematic method building partial ones. The distinction matters because the two families have entirely different guarantees: systematic search can prove unsatisfiability while local search can only fail to find a solution, which is a much weaker statement.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development