Discussion
What is the relationship between backward chaining and search?
Answer: A
Each rule matching a goal gives a branch, and the conditions give the successors, so proving a goal is a search whose nodes are subgoal sets. Prolog searches it depth first. Direct computation and independence are false. Recognising a familiar activity as an instance of search brings the whole vocabulary of completeness, ordering and pruning to bear on it, which is more useful than treating it as a separate topic.
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