Discussion
Consider the following pairings in automated inference.
Resolution - requires clausal form
Unification - makes two literals identical
Refutation - negates the goal before searching
Local search - can prove unsatisfiability
How many of the pairs given above are correctly matched?
Answer: A
The first three are correct. A local search samples assignments and can therefore only report success or failure to find one, never a proof that none exists. Systematic solvers with clause learning produce refutation proofs that can be checked independently. The distinction between finding and proving absence recurs in every search setting and it decides which method a verification task 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