Discussion
Why is the Herbrand theorem important for automated reasoning?
Answer: D
If a set of clauses is unsatisfiable, some finite set of ground instances is already unsatisfiable, so a prover may enumerate instances and use propositional methods. Finite models do not always exist, no decision procedure follows, and completeness of resolution is a separate result. Reducing an apparently infinite question to a finite one that can be found by enumeration is what turns semidecidability from an abstract statement into an actual algorithm.
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