McqMate

Q. |
## Which of the following conditions must hold for a solution to a CSP? |

A. | all relations in all constraints must hold |

B. | at least one relation in all constraints must hold. |

C. | more than one relation in all constraints must hold. |

D. | all relations in at least one constraint must hold. |

Answer» B. at least one relation in all constraints must hold. |

2.8k

0

Do you find this helpful?

2

View all MCQs in

Artificial Intelligence and Robotics (AIR)No comments yet

- Which of the Following problems can be modeled as CSP?
- Which of the following algorithm is generally used CSP search algorithm?
- If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________
- If there is a solution, breadth first search is _______________to find it
- _________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.
- Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed
- Operator PUTDOWN has which of the following sequence of actions?
- Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?
- Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS).
- If a logic produces only true statements and does not produce any false statement it shows which of the following property