Question

Given the following knowledge base:

a <- b^c.
b <- d^e.
b <- g^e.
c <- e.
d.
e.
ƒ <- a^g.

Which of the following would be the trace of resolved atoms assuming a bottoms-up proof procedure?

Select one:

a. {a,b,c,e,g}

b. {a,b,c,e,d}

c. {g,e,b,e,c,a}

d. None of these options

Constraint Satisfaction Problem (CSP) is consists of a set of _________________.

Select one:

a. Variables, heuristics, and solutions

b. Variables, domains, and backtracking

c. Variables, domains, and constraints

d. Variables, forward checking, and heuristics

Answer 1

ANSWER :1)

Correct response is OPTION (c).

JUSTIFICATION:

Let C be a Consequence set.

Therefore, the trace of resolved atoms using a bottoms-up proof procedure is as follows-

->{}
{d}
{e,d}
{c,e,d}
{b,c,e,d}
{a,b,c,e,d}.

The bottom up algorithm terminates  with C={a,b,c,e,d}. Thus, KB a, KB b, and so on.

ANSWER: 2)

Correct response is OPTION (c).

JUSTIFICATION:

Constraint Satisfaction Problem (CSP) is a problem that needs to be addressed within some constraints or conditions, also known as constraints. It consists of the following:

• A finite set of variables in which the solution is stored (V = {V1, V2, V3, ....., Vn})
• A set of discrete values ​​known as the Domain from which the solution is selected (D = {D1, D2, D3, ....., Dn})
• Finite set of constraints (C = {C1, C2, C3, ......, Cn})

If you are satisfied by my answer please give a thumbs up. Thank you.