Discussion
Why is all different stronger than a set of pairwise inequalities?
Answer: A
Three variables each with the same two valued domain are pairwise satisfiable but cannot all differ, and only a global algorithm using matching theory detects that immediately. Readability and storage are genuine but minor benefits. The example is the standard demonstration that decomposition loses information, and it justifies the whole apparatus of specialised global constraints in constraint programming systems.
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