Discussion
What is node consistency?
Answer: B
Node consistency is the weakest condition, requiring only that unary constraints be applied to each domain, which is done once at the start. Arc consistency handles binary constraints and path consistency triples. Graph connectivity, domain emptiness and pairwise assignment are different notions. A hierarchy of consistency conditions, each considering more variables at once, gives a scale on which the cost and the pruning power can be traded.
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