Discussion
Why can forward chaining fail to terminate with function symbols?
Answer: C
A rule deriving a successor from every number will generate an unbounded sequence of ground terms, so saturation never completes. Datalog forbids function symbols precisely to keep the derived set finite. Cycles alone are handled by not repeating derivations, unification terminates, and indexing is an efficiency matter. Identifying the syntactic feature responsible for an unbounded computation is what allows a decidable fragment to be carved out deliberately.
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