Question

In: Computer Science

Consider the following clauses in a knowledge base: A v ~B ~W v B ~A W...

Consider the following clauses in a knowledge base:

  1. A v ~B
  2. ~W v B
  3. ~A
  4. W v B v M

Using this knowledge-base of clauses,

  1. Show by a resolution-refutation proof that proposition M is true.
  2. Show by resolution inference and the direct proof method that the proposition M is true.

Solutions

Expert Solution

The following clauses in knowledge base is given:

  1. A v ~B
  2. ~W v B
  3. ~A
  4. W v B v M

For Understanding: If A is true than ~A is false and if ~A is true then A is false.

Note: Consider Clause numbers separately in both the methods.

(1) Show by resolution-refutation proof that proposition M is true.

Consider the following clauses in a knowledge base:

Clause-1: A v ~B

Clause-2: ~W v B

Clause-3: ~A

Clause-4: W v B v M

In resolution-refutation proof, we use proof by contradiction metohd to achieve conclusion,

In proof by contradiction method, we assume opposite of the conclusion is true and then we show that the assumption would lead to contradiction.

Here, Conculsion is: M is true.

We assume opposite: i.e. M is false. ( ~M is true) We will add new clause, Clause-5: ~M

Step-1:

From Clause-1: A v ~B and Clause-3: ~A,

We can apply disjunctive syllogism and can derive new clause, Clause-6: ~B

Explanation: A v ~B is true iff at least one of them is true. but acoording to clause-3 A is false, so ~B must be true.

Step-2:

From Clause-2: ~W v B and Clause-6: ~B,

We can apply disjunctive syllogism and can derive new clause, Clause-7: ~W

Explanation: ~W v B is true iff at least one of them is true. but acoording to clause-6 B is false, so ~W must be true.

Step-3:

From Clause-4: W v B v M, Clause-5: ~M and Clause-6: ~B,

We can apply disjunctive syllogism and can derive new clause, Clause-8: W

Explanation: W v B v M is true iff at least one of them is true. but acoording to clause-5. M is false and according to clause-6, B is false, so W must be true.

Step-4:

As we can see that, Clause-7: ~W and Clause-8: W, contradict each other.

So, Our assumption that M is false is wrong.

Hence, M is True,

(2) Show by resolution inference and the direct proof method that the proposition M is true.

Consider the following clauses in a knowledge base:

Clause-1: A v ~B

Clause-2: ~W v B

Clause-3: ~A

Clause-4: W v B v M

Here, Conculsion is: M is true.

In resolution inference and the direct proof method, we will apply various rules of inference (like Modus Ponen, Disjunctive syllogism, Transitivity etc.) to derive new clauses and ultimately to derive conclusion.

Step-1:

From Clause-1: A v ~B and Clause-3: ~A,

We can apply disjunctive syllogism and can derive new clause, Clause-5: ~B

Explanation: A v ~B is true iff at least one of them is true. but acoording to clause-3 A is false, so ~B must be true.

Step-2:

From Clause-2: ~W v B and Clause-6: ~B,

We can apply disjunctive syllogism and can derive new clause, Clause-6: ~W

Explanation: ~W v B is true iff at least one of them is true. but acoording to clause-6 B is false, so ~W must be true.

Step-3:

From Clause-4: W v B v M, Clause-5: ~B and Clause-6: ~W,

We can apply disjunctive syllogism and can derive new clause, Clause-7: M.

Explanation: W v B v M is true iff at least one of them is true. but acoording to clause-5, B is false and according to clause-6, W is false, so M must be true.

Hence, we can derive conclusion: M is true, from the given clauses using resolution inference and direct proof method.


Related Solutions

Given the following knowledge base: a <- b^c. b <- d^e. b <- g^e. c <-...
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....
Let A ∈ L(U, V ) and B ∈ L(V, W). Assume that V is finite-dimensional....
Let A ∈ L(U, V ) and B ∈ L(V, W). Assume that V is finite-dimensional. Let X be a 3 × 5 matrix and Y be a 5 × 2 matrix. What are the largest and smallest possible ranks of X, Y, and XY? Give examples of the matrix to support your answers
If V = U ⊕ U⟂ and V = W ⊕ W⟂, and if S1: U...
If V = U ⊕ U⟂ and V = W ⊕ W⟂, and if S1: U → W and S2: U⟂ → W⟂ are isometries, then the linear operator defined for u1 ∈ U and u2 ∈ U⟂ by the formula S(u1 + u2) = S1u1 + S2u2 is a well-defined linear isometry. Prove this.
Let Vand W be vector spaces over F, and let B( V, W) be the set...
Let Vand W be vector spaces over F, and let B( V, W) be the set of all bilinear forms f: V x W ~ F. Show that B( V, W) is a subspace of the vector space of functions 31'( V x W). Prove that the dual space B( V, W)* satisfies the definition of tensor product, with respect to the bilinear mapping b: V x W -> B( V, W)* defined by b(v, w)(f) =f(v, w), f E...
Show that if V is finite-dimensional and W is infinite-dimensional, then V and W are NOT...
Show that if V is finite-dimensional and W is infinite-dimensional, then V and W are NOT isomorphic.
Questionnnnnnn a. Let V and W be vector spaces and T : V → W a...
Questionnnnnnn a. Let V and W be vector spaces and T : V → W a linear transformation. If {T(v1), . . . T(vn)} is linearly independent in W, show that {v1, . . . vn} is linearly independent in V . b. Define similar matrices c Let A1, A2 and A3 be n × n matrices. Show that if A1 is similar to A2 and A2 is similar to A3, then A1 is similar to A3. d. Show that...
Let V and W be Banach spaces and suppose T : V → W is a...
Let V and W be Banach spaces and suppose T : V → W is a linear map. Suppose that for every f ∈ W∗ the corresponding linear map f ◦ T on V is in V ∗ . Prove that T is bounded.
Use resolution to prove that sentence ¬A∧¬B from the following clauses (Hint: Show ¬A and ¬B...
Use resolution to prove that sentence ¬A∧¬B from the following clauses (Hint: Show ¬A and ¬B separately) • A ⇐⇒ (B ∨ E) • E ⇒ D • C ∧ F ⇒ ¬B • E ⇒ B • B ⇒ F • B ⇒ C
1. For a map f : V ?? W between vector spaces V and W to...
1. For a map f : V ?? W between vector spaces V and W to be a linear map it must preserve the structure of V . What must one verify to verify whether or not a map is linear? 2. For a map f : V ?? W between vector spaces to be an isomorphism it must be a linear map and also have two further properties. What are those two properties? As well as giving the names...
Let T: V →W be a linear transformation from V to W. a) show that if...
Let T: V →W be a linear transformation from V to W. a) show that if T is injective and S is a linearly independent set of vectors in V, then T(S) is linearly independent. b) Show that if T is surjective and S spans V,then T(S) spans W. Please do clear handwriting!
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT