5.2. Resolution

In the last lecture we discussed about valid arguments, argument form when exactly we say an argument form to be valid and so on and we also saw various rules of inferences. The plan for this lecture is as follows in this lecture we will discuss about resolution which is an important influence rule and based on resolution we will see a proof strategy which is called as proof by resolution refutation.

This chunk serves as an introduction to the topic of resolution. It highlights that the previous discussion was about valid arguments and rules of inference, setting the stage for this lecture’s focus on the resolution rule. The resolution rule is important in logical proofs and is utilized in programming languages like PROLOG, particularly for artificial intelligence applications.

Think of the resolution rule like a detective gathering evidence. Just as a detective collects pieces of evidence to solve a case, the resolution rule combines different logical statements (or clauses) to deduce new conclusions. Just as each piece of evidence is crucial to clarify the situation, each clause in logic helps in drawing a valid conclusion.

So to begin with, let us try to understand what exactly is the resolution rule. It is a very important inference rule and it is used extensively in this programming language called PROLOG.

The resolution rule is a fundamental inference technique used to derive conclusions from given clauses. In PROLOG, a popular logic programming language, this rule is applied to infer new information based on existing facts and logical connections. Understanding this rule is essential for engaging with logical reasoning in various fields, particularly in artificial intelligence.

Imagine you are piecing together a jigsaw puzzle. Each piece has to fit perfectly with the others to create a complete picture. Similarly, the resolution rule takes different logical clauses and finds a way to fit them together to reach a valid conclusion, like completing the overall picture of logical reasoning.

Imagine you are given two clauses. So C1 is the clause and C2 is another clause. And the important property here is that I have a literal L which is present in positive form in C1 and negative form in C2.

In logical reasoning, a clause is a disjunction of literals which represent basic propositions. A literal is either a variable or a constant (like True or False). For the resolution rule, we need two clauses (C1 and C2) that share a common literal: one occurs in positive form (L in C1) and the other in negative form (¬L in C2). This setup allows us to derive new conclusions in a systematic manner.

Consider a situation where you are making a decision about whether to go for a picnic. If you have two conditions like 'It is sunny (C1)' and 'It is not raining (C2)', you can derive a conclusion based on these. The common literal here, the weather condition (sunny vs. not sunny), helps you reach a conclusion about whether you should go outside.

What this resolution rule says is the following. It says that, if it is given that the clause C1 and C2 are true, then based on the truth of these 2 clauses we can conclude, conclusion C1' ∨ C2'.

The resolution process involves taking two true clauses, C1 and C2, and utilizing the shared literal L to conclude a new clause that combines the remaining parts of C1 and C2 (C1' ∨ C2'). This ‘cancellation’ of L allows for simplification and leads to new logical insights. This aspect of resolution is what makes it such a powerful tool in logical deduction.

Think of cooking a dish where you have a recipe that requires two ingredients, let's say 'chicken' (C1) and 'spices' (C2). If the condition for a delicious meal requires both, you conclude that you can prepare a flavorful dish (C1' ∨ C2') using just those ingredients. The process of preparing the meal simplifies to what you actually have left after using the required ingredients.

And remember as per our definition of argument forms since we are saying that our resolution is a valid argument form.

An argument form is considered valid if the premises logically imply the conclusion such that it creates a tautology. The section emphasizes that resolution is indeed a valid argument form, meaning if the premises (C1 and C2) are true, the derived conclusion (C1' ∨ C2') must also necessarily hold true. This concept ensures consistency in logic.

Picture a formal debate where if the audience agrees with the argument made by the speaker (the premises), they must also accept the conclusion drawn. Just like in an effective debate, sound reasoning guarantees that if the claims are accepted, the conclusion is also accepted as valid.

So now we want to prove that indeed the resolution is the, indeed resolution in principle that we are stating here is a valid argument form. So what we have to prove is we want to prove this statement that indeed this implication is a tautology.

This part discusses extending the resolution rule to handle sets of clauses rather than just pairs. The aim is to demonstrate that if we have a collection of clauses, the method of resolution can still be applied iteratively until no further resolutions are possible. This highlights the flexibility and power of resolution across multiple clauses.

Consider a team project where each member contributes a part of the project. By repeatedly combining those contributions (just like resolving pairs of clauses), the team refines its output until it reaches a final comprehensive project (the conclusion). The iterative process mirrors how resolution works to derive a conclusion from multiple sources.

This is a very powerful proof mechanism, which is very extensively used in programming language PROLOG, thank you.

The section wraps up by reiterating the strength of the resolution method in logical proofs and reasoning. It emphasizes its relevance in computational applications, particularly in programming languages aimed at AI like PROLOG. Understanding resolution provides students with powerful intellectual tools for logical reasoning and proof strategies.

Think of resolution as a versatile tool in a toolbox. Just as a well-equipped toolbox prepares you for various tasks—be it building furniture or fixing a device—understanding resolution equips you with logical reasoning skills useful in many real-life problem-solving scenarios, especially in technology and programming.

--