Which of the following techniques for solving constraint satisfaction problems (CSPs) can always determine that there is no solution when, in fact, there is none. 1) Arc Consistency with Domain Splitting2) Stochastic Beam Search3) Stochastic Local Search4) Genetic Algorithms

Question

Jaiden Watson

Computers & Technology

9 May, 18:46

Which of the following techniques for solving constraint satisfaction problems (CSPs) can always determine that there is no solution when, in fact, there is none. 1) Arc Consistency with Domain Splitting2) Stochastic Beam Search3) Stochastic Local Search4) Genetic Algorithms

+2

Answers (2)

Know the Answer?

Tristan Tanner · Answer 1

The answer is Stochastic Local search

Explanation:

Stochastic local search is an algorithm method choice of solving computationally hard decision and optimization problems from a wide range of area including computing science, operations research, engineering, chemistry, physics.

Belen Arnold · Answer 2

The answer is 1. Arc Consistency with Domain Splitting

Explanation:

in arc consistency with domain splitting If any of the domains is wiped out during the execution then no solution

Hence Option 1 is the correct answer