7.6. Question 12

Today, we will learn about resolution and how it helps us validate logical arguments. Can anyone recall what a logical argument consists of?

It consists of premises and a conclusion.

Exactly! And we will see how resolution can be used to prove if a conclusion follows from the premises.

How do we start with an argument?

We first convert our statements into propositional variables. For instance, instead of saying 'It is raining,' we might write '¬r' to mean 'it is not raining.' Does everyone understand how this works?

So we are basically summarizing statements into simpler forms?

Correct! This simplification is essential for applying our resolution method effectively. Let's now discuss how we represent premises and conclusions as clauses.

To prove that C is a logical conclusion, we check if adding the negation of C to our premises leads us to a contradiction.

In summary, the resolution method is all about finding contradictions. If we reach an empty clause by resolving our premises with the negation of our conclusion, the conclusion is valid.

Now, let's see how to construct clauses from our premises. What do we need to include in our clauses?

We need to make sure each clause is in disjunctive normal form, right?

Correct! Each clause tells us which literals must be true for the whole clause to be true.

Can you give us an example?

Certainly! If one premise states 'If it rains, then the ground is wet,' we could represent this as 'r → w', or in clause form, '¬r ∨ w'. Remember this format as it will be key during resolution.

So we can express multiple premises like this?

Yes! Every premise can be transformed into this format for consistency. Let's summarize: Always represent premises in their clause forms to effectively apply resolution.

Now let's take a sample argument. We will work together to determine if the conclusion is valid using the resolution method. Start by writing down your premises.

Okay, so my premises are: If it is sunny, then we will go outside, and it is not sunny.

Great! Let's represent these in our clause form. What do you get?

That would be 's → o' and '¬s'.

Perfect! Now, what's the conclusion you're testing?

Shall we conclude that we will not go outside?

Correct! So we need to negate that conclusion and add it to our premises. Who can summarize the next steps?

We resolve the clauses step-by-step, looking for contradictions, right?

Exactly! Resolution shows if our premises lead us logically to our conclusion. If we end up with a contradiction, then the conclusion stands valid.