Discussion
Why can local search not prove that a problem is unsatisfiable?
Answer: D
A local search that fails to find a solution has established only that it did not find one, since it never enumerates the space and may simply have looked in the wrong region. Systematic search with propagation can exhaust the space and prove absence. Constraint evaluation and initialisation are unaffected. That a negative result from an incomplete method carries no information is the same point made about incomplete search algorithms generally, and it decides which family a problem requiring a proof must use.
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