Discussion
Why must the failure be finite for negation as failure to be sound?
Answer: B
If the attempt to prove p runs forever, the system has established nothing, and concluding not p would be unjustified. Implementations that time out and report success for the negation are unsound in exactly this way. Memory, goal identity and syntax are not the issue. A soundness condition that depends on the behaviour of a search, rather than on the logic, is easy to violate and hard to notice.
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