Discussion
When is an inference procedure said to be complete?
Answer: A
Completeness guarantees that the procedure will find a proof whenever one exists, though it may take arbitrarily long. Soundness is the converse, and decidability, that every question receives an answer, is a stronger property first order logic lacks. Halting is related but distinct. A procedure may be sound and complete and still fail to terminate on an unprovable question, which is exactly the situation in first order logic and is worth being precise about.
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