Discussion
Why do satisfiability solvers require conjunctive normal form?
Answer: A
With everything reduced to clauses, unit propagation and resolution apply uniformly and no special cases are needed for the connectives. The conversion may increase size, exponentially in the worst case unless auxiliary variables are introduced. Satisfiability is preserved rather than created, and negations remain on literals. Standardising the input so that one rule suffices, even at some cost in size, is a trade that mechanical procedures repeatedly make.
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