Discussion
Why is Prolog incomplete as a theorem prover?
Answer: D
Choosing clauses in order and backtracking gives a depth first search that may follow a left recursive rule indefinitely without ever reaching a proof that a breadth first strategy would find. Reordering the clauses often fixes it, which is why the declarative reading is only an approximation. Horn expressiveness, the occurs check and negation semantics are separate issues, though the last two also affect soundness. A search strategy fixed for efficiency, at the cost of completeness, is the same trade depth first search always presents.
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