Discussion
What is the Davis Putnam procedure?
Answer: C
The procedure assigns a variable, propagates the consequences, and backtracks when a clause becomes empty, which is the basis of every modern satisfiability solver. Its two key inferences are unit propagation and the pure symbol rule. Conversion, resolution restriction and model enumeration are different activities. A sixty year old algorithm still at the heart of state of the art tools, after decades of refinement, is unusual and worth noticing. Reading the definition literally, rather than recalling a formula, is the reliable route through questions of this shape.
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