Discussion
What is the relationship between constraint satisfaction and satisfiability?
Answer: C
A propositional formula is a constraint problem whose variables are boolean and whose constraints are clauses, so the two literatures address the same territory from different directions and share unit propagation, clause learning and restarts. Neither is strictly a special case of the other in practice, since each has developed its own encodings. Recognising two communities working on the same problem is what allows techniques to be transferred between them.
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