Question

Question text

Which of the following best describes constrained optimization problem?

Select one:

a. A constrained optimization problem is an optimization problem that maintains a priority queue of variables, where the weight of a variable is the number of conflicts in which it participates.

b. A constrained optimization problem is an optimization problem that also has hard constraints specifying which variable assignments are possible. The aim is to find an optimal assignment that satisfies the hard constraints.

c. A constrained optimization problem is an optimization problem that maintains up to n number of assignments instead of just one. It reports success when it finds a satisfying assignment.

d. A constrained optimization problem is an optimization problem that selects the best n number of individuals at random; the individuals with a better evaluation are more likely to be chosen.

True or False: A regression planner searches in the state space from the initial state to a goal state.

Select one:

True

False

Question 2

A Horn clause is either a definite clause or an integrity constraint. That is, a Horn clause has either false or a normal atom as its head.

Select one:

True

False

Question 3

Question text

__________________ is the concept of split a problem into a number of disjoint cases and solve each case separately.

Select one:

a. Domain splitting

b. Generate and Test

c. Local Search

d. Consistency Algorithm

Answer 1

b. A constrained optimization problem is an optimization problem that also has hard constraints specifying which variable assignments are possible. The aim is to find an optimal assignment that satisfies the hard constraints.

answer: TRUE

A Horn clause is either a definite clause or an integrity constraint

answer: Domain Splitting

domain splitting is the concept of split a problem into a number of disjoint cases and solve each case separately