Discussion
What is the overall message of the constraint satisfaction topic?
Answer: B
Everything in the topic follows from using a factored representation in which constraints are visible, so that inference can prune before search rather than only during it. Plain backtracking is hopeless on real instances, local search cannot prove unsatisfiability, and the problems remain NP hard. That a change of representation, rather than a cleverer algorithm, unlocks the whole apparatus is the lesson worth carrying forward to the topics that follow.
No comment is present. Be the first to comment.
Loading…
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