Discussion
Why is inference over Horn clauses efficient?
Answer: D
Applying each rule as soon as its conditions are satisfied derives the whole set of consequences in time linear in the size of the knowledge base, which is why deductive databases and Prolog are practical. Symbol counts are unrelated, satisfiability is not automatic since a set of Horn clauses may be contradictory, and resolution still applies. A restriction that converts an intractable problem into a linear one, at a stated cost in expressiveness, is the clearest possible illustration of the expressiveness against tractability trade.
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