Discussion
Why does theorem proving often outperform model checking?
Answer: B
A conclusion following from three of a thousand premises can be proved in three steps while enumeration would examine two to the thousand models. The proof ignores everything irrelevant. Termination guarantees run the other way, negation is handled by both, and symbol counts are fixed by the problem. That the length of a proof bears no relation to the size of the model space is what makes syntactic methods worth developing at all.
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