Discussion
Why does a prover negate the goal before searching?
Answer: A
Since premises entail a conclusion exactly when the premises together with the negated conclusion are unsatisfiable, and resolution is refutation complete, the proof proceeds by deriving a contradiction. Clausal conversion and clause counts are unaffected. Converting a question the available machinery cannot answer into one it can is a move that recurs throughout automated reasoning, and here it is what makes the whole approach work. A limit that survives making every external component ideal is an intrinsic one, and worth knowing for that reason.
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