Discussion
Why is truth table enumeration impractical for large problems?
Answer: C
With two to the n models, a problem with fifty symbols has more rows than could be enumerated in the age of the universe, so satisfiability solvers search cleverly instead. Implication and negation are handled correctly, and the absence of a proof is a separate objection. A definition that is exponentially large, and an algorithm that must avoid materialising it, is the shape of the whole subject of automated reasoning.
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