Artificial Intelligence and Machine Learning: Unit I(f): Constraint Satisfaction Problems (CSP)

Two marks Questions with Answers

Constraint Satisfaction Problems (CSP) - Artificial Intelligence and Machine Learning

CSP are problems whose state and goal test conform to a standard structured and very simple representation. CSP's are defined using set of variables and set of constraints on those variables.

Two Marks Questions with Answers

Q.1 What is CSP ?

AU: May-10

Ans.: CSP are problems whose state and goal test conform to a standard structured and very simple representation. CSP's are defined using set of variables and set of constraints on those variables. The variables have some allowed values from specified domain. For example Graph colouring problem. (Given graph and set of colours, colour each vertex such that no two adjacent vertices have same colour)

Q.2 What is constraint satisfaction problem?(Refer Q.1)

AU: Dec.-14
Ans.: CSP are problems whose state and goal test conform to a standard structured and very simple representation. CSP's are defined using set of variables and set of constraints on those variables. The variables have some allowed values from specified domain. For example Graph colouring problem. (Given graph and set of colours, colour each vertex such that no two adjacent vertices have same colour)

Artificial Intelligence and Machine Learning: Unit I(f): Constraint Satisfaction Problems (CSP) : Tag: : Constraint Satisfaction Problems (CSP) - Artificial Intelligence and Machine Learning - Two marks Questions with Answers