Discussion
What is negation as failure in a logic programming system?
Answer: A
The rule succeeds for not p exactly when the attempt to prove p fails finitely, which implements the closed world assumption operationally. It is sound only when the program is complete about p. The third option overstates it slightly by ignoring the finiteness requirement, and the others misdescribe it. An operational rule standing in for a semantic assumption must be used only where the assumption holds, which is a condition rarely checked in practice. The quantity that varies and the quantity that does not are worth naming before any substitution is attempted.
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