Discussion
Why is input resolution complete for Horn clauses but not in general?
Answer: C
A refutation from Horn clauses can always be arranged so that each step uses an original clause, which is not true when clauses have several positive literals. That structural fact is what logic programming rests on. Horn clauses do contain negative literals, conversion is not the issue, and a Horn set may certainly be unsatisfiable. A completeness result that depends on the shape of the available proofs, rather than on the rule, is worth understanding as such.
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