Discussion
How is a constraint satisfaction problem specified?
Answer: A
A constraint problem gives a set of variables, a domain of permitted values for each and a set of constraints restricting which combinations are allowed, and a solution is an assignment satisfying all of them. The classical search formulation is different, and rules and objectives belong to other frameworks. Adopting a representation in which the structure of a problem is visible, rather than hidden inside a successor function, is what makes the specialised algorithms possible.
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