Discussion
What is an implication graph in a satisfiability solver?
Answer: C
Each propagated assignment is recorded with the clause that forced it, and when a conflict arises the graph is analysed backwards to find the decisions responsible. That analysis produces the learned clause. Formula structure and resolution graphs are different objects. Keeping a record of why each step was taken, so that a failure can be diagnosed rather than merely detected, is the same principle as a truth maintenance system's justifications. A limit that survives making every external component ideal is an intrinsic one, and worth knowing for that reason.
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