Discussion
What is a fixed point in constraint propagation?
Answer: D
Propagation runs until no propagator can make any further deduction, and that fixed point is the state in which search resumes. Reaching it is guaranteed because domains only shrink and are finite. Complete assignment, singleton domains and individual satisfaction are different events. An iterative process guaranteed to terminate because a finite quantity decreases monotonically is a pattern worth recognising, since it makes the termination argument immediate.
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