adplus-dvertising
frame-decoration

Question

If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________

a.

arc consistent

b.

i- consistent

c.

path consistent.

d.

2- consistent

Answer: (c).path consistent.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________

Similar Questions

Discover Related MCQs

Q. Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed?

Q. _____________ Procedure selects a flaw in a given plan and looks for a resolver.

Q. _____________search regresses over goals and validate a plan before returning it.

Q. Is optimality and completeness exist in bidirectional search algorithm?

Q. When will Hill-Climbing algorithm terminate?

Q. A* algorithm is based on __________

Q. What is the heuristic function of greedy best-first search?

Q. Uniform-cost search expands the node n with the __________

Q. Which of the following search algorithm searches forward from initial state and backward from goal state till both meet to identify a common state?

Q. The process of removing detail from a given state representation is called ______

Q. What is Space Complexity of Depth First search algorithm?

Q. What is Branching Factor?

Q. Searching using query on Internet is, use of ___________ type of agent.

Q. What is disadvantage of Greedy Best First Search?

Q. Greedy search strategy chooses the node for expansion in ___________

Q. Which data structure conveniently used to implement BFS?

Q. Depth-First Search is implemented in recursion with _______ data structure.

Q. What is Time Complexity of Breadth First search algorithm?

Q. What is Initial state + Goal state in Search Terminology?

Q. What is the main task of a problem-solving agent?