Discussion
What is the dual encoding of a constraint problem?
Answer: A
In the dual, each original constraint becomes a variable whose domain is its satisfying tuples, and two such variables are constrained to agree wherever they share an original variable. It converts any problem to binary form at the cost of large domains. Negation and duplication describe different transformations. Two encodings of the same problem, with different propagation behaviour, is a choice that a modeller can exploit deliberately.
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