Discussion
What is Datalog?
Answer: D
Forbidding function symbols keeps the set of derivable facts finite, so forward chaining terminates and the language is decidable, which makes it suitable for deductive databases. Recursion is permitted and is its main advantage over relational query languages. Schema description, negation and graph querying are different things, though modern variants add some of them. A deliberate restriction adopted to obtain decidability is the same design move that produced description logics.
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