Question

True/False: Bottom-up and top-down proof procedures can be proven to be sound and complete.

Select one:

True

False

Question 10

Question text

Which of the following algorithm selects a successor of the current assignment that most improves some evaluation function and if there are several possible successors that one is chosen at random?

Select one:

a. Consistency algorithm

b. Generate-and-Test algorithm

c. Constraint algorithm

d. Iterative Best Improvement algorithm

Clear my choice

Question 11

Question text

Which of the following statements best describe Iterative Best Improvement algorithm?

Select one:

a. It starts with a total assignment of a value to each variable and tries to improve this assignment iteratively by taking improving steps, by taking random steps, or by restarting with another total assignment.

b. It selects a successor of the current assignment that most improves some evaluation function and if there are several possible successors that most improve the evaluation function, one is chosen at random.

c. It splits a problem into a number of disjoint cases and tries to solve each case separately and recursively.

d. All of the above

Clear my choice

Question 12

Question text

Given the following compound proposition, evaluate if this proposition is true or false when p, q, and r are true.

p ∧ q → ¬r

Select one:

True

False

Answer 1

1)

Bottom-up and top-down proof procedures can be proven to be sound and complete.

True

explanation:

The bottom-up proof procedure builds on atoms that have already been established. It should be contrasted with a top-down approach, which starts from a query and tries to find definite clauses that support the query.

Soundness: A proof procedure P is sound if KB ⊦P g implies KB ⊧ g.

Completeness: A proof procedure P is complete if KB ⊧ g implies KB ⊦P g.

The two methods derive exactly the same atoms (if the SLD resolution picks the successful derivations) – And the bottom-up procedure is sound and complete – Therefore the top-down procedure is sound and complete

2)

Which of the following algorithm selects a successor of the current assignment that most improves some evaluation function and if there are several possible successors that one is chosen at random?

d. Iterative Best Improvement algorithm

explanation:

Iterative best improvement is a local search algorithm that selects a successor of the current assignment that most improves some evaluation function. If there are several possible successors that most improve the evaluation function, one is chosen at random. Iterative best improvement requires a way to evaluate each total assignment. For constraint satisfaction problems, a common evaluation function is the number of constraints that are violated. A violated constraint is called a conflict. With the evaluation function being the number of conflicts, a solution is a total assignment with an evaluation of zero. Sometimes this evaluation function is refined by weighting some constraints more than others.

3)

Which of the following statements best describe Iterative Best Improvement algorithm?

d. All of the above

4)

False

explanation:

p, q and r are True.

p = True

q = True

p q = True True = True

stands for AND operation which suggests True, only if both propositions are True and False otherwise.

So, p q = True

r = True

¬r = ¬True = False

Therefore, p q ¬r

Hence, the statement p ∧ q → ¬r is False.