# (Refer Slide Time 03:00)

Size: px
Start display at page:

Transcription

1 Artificial Intelligence Prof. Anupam Basu Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 15 Resolution in FOPL In the last lecture we had discussed about inferencing mechanism in first order predicate logic. We ended with examples of inferencing where we eliminated universal quantifiers, we eliminated existential quantifiers and also at times we introduced existential quantifiers. We also saw two very important operators as to how they are used. One is substitution and another is unification. Now, one very powerful inferencing mechanism used in inferencing in first order predicate logic is resolution. Resolution is an inferencing method that is sound and it can be automated as well. Therefore in today s lecture we will be discussing how we infer make inferences using the resolution method. Before we start discussing about resolution technique as applied in first order predicate logic we will have a brief revisit a revision of how it was applied in propositional logic. We discussed this earlier also. So let us quickly have a recapitulation of how resolution was applied in propositional logic and then we will see how it can be applied in the case of predicate logic. (Refer Slide Time 03:00) So here the basic principle is that, suppose (x) is a literal and S1 and S2 are two sets of propositional sentences, right now we are not discussing predicate logic cases but we are restricting ourselves to propositional logic cases. And what is the basic difference between propositional logic and predicate logic as we have seen? First, in predicate logic we can have variables whereas in propositional logic the parameters are all constant. And the second difference is that, in predicate logic we can have quantifiers over these variables and may need two type of quantifiers namely the existential quantifier and

2 universal quantifier and such quantification is not there in propositional logic. So here suppose S1 and S2 the sets of propositional sentences represented in the clausal form, we already know what a Clausal form is, and clause is a disjunction of literals. And also we mentioned what a horn clause is. In the horn clause on the right hand side of the implication there can be only one literal that means in the clausal form there can be at most one non negative literal because p AND q implies r in that case if I write in the clausal form p AND q implies r if I convert into the clausal form it will become NOT p OR NOT q OR. So if there can be only one literal on the right hand side and the left hand side are all conjunctions then when converted in the clausal form we will have at most one non negative literal. But clause is a disjunction of literals so suppose (x) is a literal and S1 and S2 are two sets of propositional sentences which we have represented in the clausal form. If we have (x) OR S1 AND NOT (x) OR S2 then we get S1 OR S2. Look at this, this is a revisit, we have already shown the same slides while discussing the propositional logic. So here if I just do this AND then obviously (x) OR NOT (x) will be always be true. So S1 OR S2 will come true. Here S1 OR S2 this entire thing is called the resolvent. That means these two we have resolved in order to get this and (x) has been resolved upon. (Refer Slide Time 06:15) So the same old example, if a triangle is equilateral then it is isosceles, if a triangle is isosceles then the two sides AB and AC are equal, if AB and AC are equal then angle B and angle C are equal ABC is a equilateral triangle and we are supposed to prove angle B is equal to angle C.

3 (Refer Slide Time 06:38) Now given this we next represent these in the form of propositions. If a triangle is equilateral then it is isosceles. So we can write equilateral ABC implies isosceles ABC. If a triangle is isosceles then the two sides AB and AC are equal that we can represent as isosceles ABC implies equal AB AC. If AB and AC are equal then angle B and angle C are equal. Written in the predicate form it turns out to be equal AB AC implies equal B and C where B and C are angles. ABC is an equilateral triangle so simply we can write equilateral ABC. What is the next step? We have to convert them to clausal form. Now we had equilateral ABC implies isosceles ABC converted to clause it becomes NOT equilateral ABC OR isosceles ABC. Isosceles ABC implies equal AB AC and that one translates to NOT isosceles ABC OR equal AB AC. Similarly, equal AB AC implies equal BC gets converted to NOT equal AB AC why is this NOT because if I convert this in the clausal form this antecedent part becomes negated, there is a mistake NOT equal AB AC should be changed to OR just has happened here NOT equal AB AC OR equal BC. And next one is equilateral ABC. So now we have got all these in the clausal form. Now the basic of resolution is proof by refutation. That means to prove that angle B is equal to angle C that is equal BC. Our approach is to disprove that B and C are not unequal. This is a very well known proof method where in order to prove that B and C are equal we first try to prove B and C are not equal and fail to prove it. So we try to disprove NOT equal BC.

4 (Refer Slide Time 09:40) Our objective is to prove this equal BC. So we start with NOT equal BC and we try to disprove it. So what is there? We take the clausal form of the goal and negate it and try to disprove it and that is our approach. So let us look at this animated resolution. We have got in our knowledge base all these clauses equilateral ABC OR isosceles ABC etc that we have discussed and this is the one we want to prove. We want to disprove this NOT equal BC you have to disprove this. Therefore, in order to prove equal BC we want to disprove NOT equal BC and then we have to resolve it and from here we will have to select one clause where we have got the negation of this equal BC that is here equal BC. This is NOT equal BC and here is equal BC so I select this clause and take this NOT equal AB AC OR equal BC. Now this part and this part will resolve together and we get NOT equal AB AC so this is the first level resolvent. Now we have to find the dual of NOT equal AB AC, there is equal AB AC here so that is this one. Now I try to resolve this resolvent with this clause and as I do it what do I get? I get equal AB AC and NOT equal AB AC resolved upon and we will get NOT isosceles ABC here. So this is a new resolvent and NOT isosceles ABC we start with that and which one should we select? Obviously it is this one because this one has got the negation of this. Here isosceles ABC is there so I select this and as I resolve these two what do I get? These two again resolve out and I get NOT equilateral ABC. And when I resolve out NOT equilateral ABC with this one equilateral ABC what do I get? I get a null clause. That means point from where I started is disproved. Here g is a null clause that means I am trying to resolve two contradictions. That means the goal with which I started is not consistent with the knowledge base that I have.

5 (Refer Slide Time 12:27) With the given knowledge base the goal which I started with is contradictory. Now what was the goal? The goal was the negation of the goal that I actually wanted to prove. So the negation of the goal that I wanted to prove is disproved. Therefore the actual goal is proved. That is the principle of resolution. And the same principle will hold for resolution in case of predicate logic as well. Next let us quickly see the basic steps of carrying out resolution for propositional calculus. First step is we convert the given propositions into clausal form. Next we convert the negation of the sentence to be proved. Please note that we take a sentence to be proved and then we first negate it and after this negation we convert it to the clausal form. So convert the negation of the sentence to be proved into clausal form. Combine all the clauses in a set. And then iteratively apply resolution to the set. One of the candidates that we start with is the clausal form of the negation of the goal that I want to disprove. So I take that one and take a suitable clause from the remaining clauses in the set and try to resolve it. If the resolution is possible then through this resolution I will get a new clause. Then I will take the new clause and take another one and try to resolve it further until all the clauses are exhausted or I come across a contradiction that is a null clause. As soon as I get a null clause then I immediately prove that the negation of the goal is contradictory therefore the goal is true. So I iteratively apply a resolution to the set and add the resolvent of every iteration to the sentence. Then we continue until no further resolvents can be obtained or a null clause is obtained and that is where we stop. That is the way resolution works. And we have seen it through an example. Next, when we try to do it for predicate logic there will be some differences but the major principle of resolution is remaining the same, the major approach is remaining the same. Here also we will start with the negation of the goal converted into clausal form and the procedure of generation of resolvents are the same.

7 (Refer Slide Time 19:07) Therefore we intend to code this problem in first order predicate calculus. And then we will use resolution refutation, this resolution is also known as resolution refutation. Now why this word refutation is coming in? You can very simply guess. What are we trying to refute? In order to prove a particular goal g we are trying to refute NOT g and if we can refute NOT g then we are proving g. That is what resolution is all about. So we are using resolution refutation to solve a problem. What is solving a problem? Solving means finding out whether the conclusion can be answered from the given set of sentences. The conclusion is whether we can prove the statement; is someone smiling using whatever is there. Now, in order to capture the sentences we had shown we will have to first convert them in the form of predicates. In order to make the statement (x) is graduating someone is graduating we have to select the predicate and we have selected the predicate graduating (x) and that shows (x) is graduating. Depending on the programming language we are using there will be some syntax s, here the conventions should have been in the order that all these predicates start with small letters. Here, (x) is happy I can write as happy (x), (x) is smiling, smiling (x). Now we try to encode these sentences into predicate logic using the predicates that I have just now stated. All people who are graduating are happy.

8 (Refer Slide Time 21:50) That can be certainly written as; for all (x) graduating (x) implies happy (x). All people who are graduating are happy and that is universal quantification so there is no problem with that. All happy people smile is again universal quantification. someone is graduating, here it is shown but you could have also done that, someone is graduating, and this parenthesis is not required like this here because there is no scope of it, there exists (x) such that graduating (x) that is someone is graduating. Is someone smiling? That was my objective but let us consider that this statement is; someone is smiling. That means there exists (x) such that smiling (x) is true. So, if there exists (x) smiling (x) is found to be true then the answer to this question is someone smiling is yes. So the first step was selecting the suitable predicates. And once the suitable predicates are chosen then the next step you do is write down these sentences express those sentences using predicate logic, using implication, using quantifiers. But the next step would be, you take these predicates here as they are but here I have made a small change, is someone smiling or someone is smiling was stated as there exists (x) such that smiling (x). And that was the conclusion and the negation of the conclusion therefore is there does not exist (x) such that smiling (x). If I can prove this that there does not exist (x) such that smiling (x) that means no one is smiling. But if I disprove it that means someone is smiling. So we first negate the conclusion and then keep the others as they are. I have not made any change in this.

9 (Refer Slide Time 24:58) But the next step is we have to convert them into clausal form. In order to convert them into clausal form the first step would be to eliminate the implication operation and to eliminate this implication operation you know that we will take this clause for example. We are retaining this for all (x) for the time being and graduating (x) implies happy (x) will be not graduating (x) OR happy (x). (Refer Slide Time 25:31) Similarly we can do it for the others. Happy (x) was implying smiling (x) so that gets converted to NOT happy (x) OR smiling (x). There exists (x) graduating (x) and this did not have any implication at all and that was as it is and the second one was also not

10 having any implication, this one the fourth one was also not having any implication. Now I have got a set of clauses which are all free of the implication sign. The next step is to convert them to canonical form. Now it may be that this canonical form often called normal form may be new to you but let us not get too much bogged down with it, it is a form where quantifiers are there and we have got the examples of inference. (Refer Slide Time 27:02) Ultimately we are trying to go to the clausal form and it is basically a conjunctive normal form so there will be disjunctions and there can be disjunctions in clauses. The next step to do that is to reduce the scope of negation. So let us have a quick re look at what we had earlier. For the first two the scope of the negation is over this predicate graduating (x). And for this the scope of this negation is over this entire thing even over this quantifier. So the scope of the negation is fine over here I do not make any change here. However, just compare the earlier clause number four and the present clause number four. Here the scope of negation was over this quantifier as well as this statement. Now I want to push this negation as much as close to the particular predicate. So negation of the existential quantifier is a universal quantifier. For example, I say there does not exist a person, there does not exist any (x) such that NOT mortal (x) but (x) is a man. So there does not exist I can convert it to for all (x) mortal x. I say that there does not exist a person there does not exist (x) such that NOT mortal x. So the same meaning is communicated if I say for all people for all (x) mortal (x) so I convert that there exists for all and NOT mortal to mortal. So I push the negation inside so that is exactly what is being done over here. This earlier one gets transferred to; for all (x) NOT smiling (x). So I have reduced the scope of negation here. The next thing we need to do is, we have to standardize the variables apart. It is possible that we can put in the same variable that might have been used at different points. For example, here graduating (x) happy (x) here again NOT happy (x) smiling (x) all those

11 things but when I am trying to do this what I will try to do is, for every clause I will change the different variables; every sentence will have a distinct variable. Now if you recollect the idea of unification, now this automatically gives rise to some problem that if we have got different types of variables then we must have some mechanical means of converting those variables in some way in order that we can do the unification. (Refer Slide Time 32:22) After we do this the next thing that we need to do is standardize the variables. So here you can see for graduating (x) happy (x) happy (x) or smiling (x) we take the liberty of using different variables. For all (x) NOT graduating (x) OR happy (x) so this one has got x, this has got y. Now if there were if there was a clause like graduating (x) and happy (y) in that case both (x) and (y) are reserved for that clause. In the other clauses we will have to use y z p q all those things. And only later as we will see we will try to see whether these variables can be compared or unified. You remember what we discussed about unification. Unification is the process of finding a particular substitution of variables such that two different clauses become identical. Therefore we will have to do that unification anyway. Here we have selected smiling (y). Now here again we have introduced another one z and for all w smiling (w) so here we have made a change again. You can very well realize that still it is not a clause. So let us quickly recapitulate whatever we have done till now. What we have done is we are trying to convert it to clausal form. The first step is we have selected some predicates and after selection of the predicates we encoded the given sentences in the form of first order predicate logic. And then we negated the goal and put it in the knowledge base then we will start converting then we took the canonical form or the clausal form, how do we do it? In order to do that we will first eliminate the implication sign and that can be achieved by the simple rule that we

12 have come across so many times p implies q is not p OR q and there also we convert the entire knowledge base including the negation of the goal. After that we reduce the scope of implication and after that we try to bring the negation as close as possible to the variables and in that process we may require to change the quantifiers also. For example, NOT for all (x) will become there exists (x) NOT there exists (x) will become for all x. After reducing the scope of negation we standardize the variables. Once these variables are standardized then we try to push all the quantifiers to the left. In this example the quantifiers were not very much within but there can be complicated clauses. (Refer Slide Time 36:08) For example, there can be something like this; for all (x) I am not bothering about too much of meaning here say P(x) implies there can be something else there exists y such that Q y it is possible like to express something like this it is possible. So in such cases there are two quantifiers but ultimately my objective will be to push all the quantifiers to the outside as much as possible. So the next thing that we try to do is, we move all the quantifiers to the left and using which we get in this case there was not much of change we come to these four clauses. Then we have to start working on elimination of the quantifiers. First of all let us try to eliminate the existential quantifier. And we are already introduced to the process of skolemization. skolemization is a process of finding a constant or a function for the existentially quantified variable that will make this clause to be true. For example, here there were no existential quantification at all. The only existential quantification in this case we had was this. That was the only existential quantification. It was, there exists z such that graduating z we remove that and in place of that we find out (name1).

13 (Refer Slide Time 39:05) (name1) is a skolemization constant. It is a name that somehow we are finding out who is graduating. So that particular value of (x) or (z) is the case is satisfying this statement graduating (x). In the last lecture we had also shown that in some cases we replace it NOT with a constant but with a skolemization function. Like in the prime divisibility case we had selected a function p d. So we have removed the existential quantifier that was the step five. (Refer Slide Time 40:01) What is the sixth step?

14 We drop all the universal quantifiers because of the simple reason we do not really need it. By now I have removed the existential quantifiers by now I have reduced the scope of negation to as close as possible to the predicates. And by now I have pushed all the quantifiers to the left and the existential quantifiers have been removed already. So what is left is just the universal quantifier and all these clauses are now implicitly universally quantified. So I need not specify any further and so I can simply drop them. And as I drop them I get these clauses. In this case again we only had disjuncts. In a canonical form it can be conjuncts of disjuncts what is a disjunct? Again let us go here; I have got P(x) OR Q(x) this is a disjunction. And say M(x) AND N(x) this is a conjunct. This is a disjunct and this is a conjunct. Now, canonical form is a conjunction of disjuncts. So I can say that P(x) OR Q(x) if I have a form M(x) OR N(x). Now this is R(y) OR G(z). Now this is another disjunct. So this is a disjunct, this is a disjunct and I have got a conjunction of this disjunct so it is a conjunct. Therefore canonical form will be a conjunction of disjuncts only and that is the canonical form. What is the implication of this? The implication of this is, if I have conjunction of disjuncts, whatever I have written here I just take that as an example and if you just think a little while you will realize that once I have conjuncts of disjuncts then each of these disjuncts I can write down separately. And this one I can write down separately as P(x) OR Q(x) and this one I can write down separately as R(y) OR G(z). Now according to our definition both these are clauses and a conjunction of disjuncts therefore each of these disjuncts can be written down as a separate clause and that is our objective, convert in the clausal form. (Refer Slide Time 44:33) So, after we have dropped all these quantifiers we convert to conjunct of disjunct form and make each of these as a separate clause and we standardize variables apart again. So

15 each of these clauses will now have separate variables. These steps do not change the set of clauses in the present problem. (Refer Slide Time 44:51) Now we come to the resolution problem. The steps 7 and 8 are not so much important here because by step 6 here we have already got them in the clausal form. Therefore we now can apply resolution and let us recall how should we start resolution? We will start with the clause that is the negation of the goal to be proved. Then from the remaining clauses in our knowledge base we will select the clause that can resolve this. Now start with this NOT smiling (w) and I will try to resolve with this with which one should I resolve? I will select from these clauses the clause which has got complementary of the negation of this so obviously this clause clause two should be selected. And if we resolve these two then what we get? The resolvent is NOT happy (y). But there is a big question here. In case of propositional logic the problem was not there but here since I have got variables and I have standardized the variables NOT smiling (w) and smiling (y) can be resolved. they can be resolved only if there is a possibility of substitution, there is a possible correct substitution, if I can substitute y by w then only I can unify these two, then only this smiling (y) and smiling (w) will become Q y. So, merely resolution will not do. And what will be the result of the resolvent? Will it be happy (y)? Here I have NOT smiling (w) and here I had the clause two NOT happy (y) OR smiling (y) and I can resolve this only under a substitution where w is substituting y. So this one becomes happy (w), smiling (w) and this smiling (w) and NOT smiling (w) resolve out and I get NOT happy (w).

18 (Refer Slide Time 54:57) (Refer Slide Time 55:18) Now, if I convert them in clausal form I get this: A is a package B is a package A is in room 27 OR A is in room twenty eight that was the problem here. Package A is in either in room 27 or 28 and package B is in room 27. And package B is not smaller than package A. Now my question is in which room is A. that is, I have to prove that there exists a some room number there exists u such that in I standing for in A u, A is in u. so that is my goal query. So I have to negate it for resolution. So the negation of the clause is this is as straight away taken from Nilsson s book: NOT of A, u and only thing I have added is for this u I have got an answer literal.

19 As I go on resolving this obviously I will select a clause which can resolve this out so I take this and I can resolve it with the substitution of 27 for u otherwise this is not substituted. So u is substituted with 27 and I get the resolvent A twenty eight my resolvent becomes this. And with this now I look for a particular clause which can resolve this out. I take the first clause and as I resolve this I resolve it with a particular substitution that is y is replaced with A and based on that when I go on doing it I am remembering the substitution and in this way as I come here I substitute this and ultimately when I get this contradiction this leaf node will come to 27 and that is my answer. (Refer Slide Time 57:55) In the normal resolution case this part was not there, if it was there I would have started with this and ultimately I would have come to a null clause here. But if I start with adding with the negation of the goal a clausal form of that or I put this answer of that literal u in which I want to hold the answer. Then the substitution values will automatically put me in the resolve I want and that will come as a leaf node. So the same resolution method can be applied to carry this out. So in this lecture we have seen that we can apply the resolution refutation method for the case of predicate logic with some additional techniques as discussed namely the clausal form, the unification part and also we can apply this to find out answers to some questions by applying it in an intelligent manner.

### Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture- 10 Inference in First Order Logic I had introduced first order

### Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture- 9 First Order Logic In the last class, we had seen we have studied

### Artificial Intelligence. Clause Form and The Resolution Rule. Prof. Deepak Khemani. Department of Computer Science and Engineering

Artificial Intelligence Clause Form and The Resolution Rule Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Module 07 Lecture 03 Okay so we are

### Artificial Intelligence: Valid Arguments and Proof Systems. Prof. Deepak Khemani. Department of Computer Science and Engineering

Artificial Intelligence: Valid Arguments and Proof Systems Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Module 02 Lecture - 03 So in the last

### Revisiting the Socrates Example

Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified

### Module 5. Knowledge Representation and Logic (Propositional Logic) Version 2 CSE IIT, Kharagpur

Module 5 Knowledge Representation and Logic (Propositional Logic) Lesson 12 Propositional Logic inference rules 5.5 Rules of Inference Here are some examples of sound rules of inference. Each can be shown

### Announcements. CS243: Discrete Structures. First Order Logic, Rules of Inference. Review of Last Lecture. Translating English into First-Order Logic

Announcements CS243: Discrete Structures First Order Logic, Rules of Inference Işıl Dillig Homework 1 is due now Homework 2 is handed out today Homework 2 is due next Tuesday Işıl Dillig, CS243: Discrete

### 10.3 Universal and Existential Quantifiers

M10_COPI1396_13_SE_C10.QXD 10/22/07 8:42 AM Page 441 10.3 Universal and Existential Quantifiers 441 and Wx, and so on. We call these propositional functions simple predicates, to distinguish them from

### Russell: On Denoting

Russell: On Denoting DENOTING PHRASES Russell includes all kinds of quantified subject phrases ( a man, every man, some man etc.) but his main interest is in definite descriptions: the present King of

### Transition to Quantified Predicate Logic

Transition to Quantified Predicate Logic Predicates You may remember (but of course you do!) during the first class period, I introduced the notion of validity with an argument much like (with the same

### INTERMEDIATE LOGIC Glossary of key terms

1 GLOSSARY INTERMEDIATE LOGIC BY JAMES B. NANCE INTERMEDIATE LOGIC Glossary of key terms This glossary includes terms that are defined in the text in the lesson and on the page noted. It does not include

### 6.080 / Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

### Semantic Entailment and Natural Deduction

Semantic Entailment and Natural Deduction Alice Gao Lecture 6, September 26, 2017 Entailment 1/55 Learning goals Semantic entailment Define semantic entailment. Explain subtleties of semantic entailment.

### TWO VERSIONS OF HUME S LAW

DISCUSSION NOTE BY CAMPBELL BROWN JOURNAL OF ETHICS & SOCIAL PHILOSOPHY DISCUSSION NOTE MAY 2015 URL: WWW.JESP.ORG COPYRIGHT CAMPBELL BROWN 2015 Two Versions of Hume s Law MORAL CONCLUSIONS CANNOT VALIDLY

### 16. Universal derivation

16. Universal derivation 16.1 An example: the Meno In one of Plato s dialogues, the Meno, Socrates uses questions and prompts to direct a young slave boy to see that if we want to make a square that has

### What would count as Ibn Sīnā (11th century Persia) having first order logic?

1 2 What would count as Ibn Sīnā (11th century Persia) having first order logic? Wilfrid Hodges Herons Brook, Sticklepath, Okehampton March 2012 http://wilfridhodges.co.uk Ibn Sina, 980 1037 3 4 Ibn Sīnā

### Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras

(Refer Slide Time: 00:14) Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 35 Goal Stack Planning Sussman's Anomaly

### Logic: A Brief Introduction. Ronald L. Hall, Stetson University

Logic: A Brief Introduction Ronald L. Hall, Stetson University 2012 CONTENTS Part I Critical Thinking Chapter 1 Basic Training 1.1 Introduction 1.2 Logic, Propositions and Arguments 1.3 Deduction and Induction

### An Introduction to. Formal Logic. Second edition. Peter Smith, February 27, 2019

An Introduction to Formal Logic Second edition Peter Smith February 27, 2019 Peter Smith 2018. Not for re-posting or re-circulation. Comments and corrections please to ps218 at cam dot ac dot uk 1 What

### 9.1 Intro to Predicate Logic Practice with symbolizations. Today s Lecture 3/30/10

9.1 Intro to Predicate Logic Practice with symbolizations Today s Lecture 3/30/10 Announcements Tests back today Homework: --Ex 9.1 pgs. 431-432 Part C (1-25) Predicate Logic Consider the argument: All

### Inference in Cyc. Copyright 2002 Cycorp

Inference in Cyc Logical Aspects of Inference Incompleteness in Searching Incompleteness from Resource Bounds and Continuable Searches Efficiency through Heuristics Inference Features in Cyc We ll be talking

### 2.1 Review. 2.2 Inference and justifications

Applied Logic Lecture 2: Evidence Semantics for Intuitionistic Propositional Logic Formal logic and evidence CS 4860 Fall 2012 Tuesday, August 28, 2012 2.1 Review The purpose of logic is to make reasoning

### A BRIEF INTRODUCTION TO LOGIC FOR METAPHYSICIANS

A BRIEF INTRODUCTION TO LOGIC FOR METAPHYSICIANS 0. Logic, Probability, and Formal Structure Logic is often divided into two distinct areas, inductive logic and deductive logic. Inductive logic is concerned

### Probability Foundations for Electrical Engineers Prof. Krishna Jagannathan Department of Electrical Engineering Indian Institute of Technology, Madras

Probability Foundations for Electrical Engineers Prof. Krishna Jagannathan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 1 Introduction Welcome, this is Probability

### UC Berkeley, Philosophy 142, Spring 2016

Logical Consequence UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane 1 Intuitive characterizations of consequence Modal: It is necessary (or apriori) that, if the premises are true, the conclusion

### logic is everywhere Logik ist überall Hikmat har Jaga Hai Mantık her yerde la logica è dappertutto lógica está em toda parte

SHRUTI and Reflexive Reasoning Steffen Hölldobler logika je všude International Center for Computational Logic Technische Universität Dresden Germany logic is everywhere First-Order Logic la lógica está

### Logic & Proofs. Chapter 3 Content. Sentential Logic Semantics. Contents: Studying this chapter will enable you to:

Sentential Logic Semantics Contents: Truth-Value Assignments and Truth-Functions Truth-Value Assignments Truth-Functions Introduction to the TruthLab Truth-Definition Logical Notions Truth-Trees Studying

### Selections from Aristotle s Prior Analytics 41a21 41b5

Lesson Seventeen The Conditional Syllogism Selections from Aristotle s Prior Analytics 41a21 41b5 It is clear then that the ostensive syllogisms are effected by means of the aforesaid figures; these considerations

### Ling 98a: The Meaning of Negation (Week 1)

Yimei Xiang yxiang@fas.harvard.edu 17 September 2013 1 What is negation? Negation in two-valued propositional logic Based on your understanding, select out the metaphors that best describe the meaning

### Lecture Notes on Classical Logic

Lecture Notes on Classical Logic 15-317: Constructive Logic William Lovas Lecture 7 September 15, 2009 1 Introduction In this lecture, we design a judgmental formulation of classical logic To gain an intuition,

### Announcements. CS311H: Discrete Mathematics. First Order Logic, Rules of Inference. Satisfiability, Validity in FOL. Example.

Announcements CS311H: Discrete Mathematics First Order Logic, Rules of Inference Instructor: Işıl Dillig Homework 1 is due now! Homework 2 is handed out today Homework 2 is due next Wednesday Instructor:

### Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras

(Refer Slide Time: 00:26) Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 06 State Space Search Intro So, today

### Pearson Education Limited Edinburgh Gate Harlow Essex CM20 2JE England and Associated Companies throughout the world

Pearson Education Limited Edinburgh Gate Harlow Essex CM20 2JE England and Associated Companies throughout the world Visit us on the World Wide Web at: www.pearsoned.co.uk Pearson Education Limited 2014

### A. Problem set #3 it has been posted and is due Tuesday, 15 November

Lecture 9: Propositional Logic I Philosophy 130 1 & 3 November 2016 O Rourke & Gibson I. Administrative A. Problem set #3 it has been posted and is due Tuesday, 15 November B. I am working on the group

### Study Guides. Chapter 1 - Basic Training

Study Guides Chapter 1 - Basic Training Argument: A group of propositions is an argument when one or more of the propositions in the group is/are used to give evidence (or if you like, reasons, or grounds)

### Logic: A Brief Introduction

Logic: A Brief Introduction Ronald L. Hall, Stetson University PART III - Symbolic Logic Chapter 7 - Sentential Propositions 7.1 Introduction What has been made abundantly clear in the previous discussion

### Introduction to Statistical Hypothesis Testing Prof. Arun K Tangirala Department of Chemical Engineering Indian Institute of Technology, Madras

Introduction to Statistical Hypothesis Testing Prof. Arun K Tangirala Department of Chemical Engineering Indian Institute of Technology, Madras Lecture 09 Basics of Hypothesis Testing Hello friends, welcome

### Statistics for Experimentalists Prof. Kannan. A Department of Chemical Engineering Indian Institute of Technology - Madras

Statistics for Experimentalists Prof. Kannan. A Department of Chemical Engineering Indian Institute of Technology - Madras Lecture - 23 Hypothesis Testing - Part B (Refer Slide Time: 00:22) So coming back

### Name: Course: CAP 4601 Semester: Summer 2013 Assignment: Assignment 06 Date: 08 JUL Complete the following written problems:

Name: Course: CAP 4601 Semester: Summer 2013 Assignment: Assignment 06 Date: 08 JUL 2013 Complete the following written problems: 1. Alpha-Beta Pruning (40 Points). Consider the following min-max tree.

### What is the Frege/Russell Analysis of Quantification? Scott Soames

What is the Frege/Russell Analysis of Quantification? Scott Soames The Frege-Russell analysis of quantification was a fundamental advance in semantics and philosophical logic. Abstracting away from details

### John Buridan. Summulae de Dialectica IX Sophismata

John Buridan John Buridan (c. 1295 c. 1359) was born in Picardy (France). He was educated in Paris and taught there. He wrote a number of works focusing on exposition and discussion of issues in Aristotle

### ILLOCUTIONARY ORIGINS OF FAMILIAR LOGICAL OPERATORS

ILLOCUTIONARY ORIGINS OF FAMILIAR LOGICAL OPERATORS 1. ACTS OF USING LANGUAGE Illocutionary logic is the logic of speech acts, or language acts. Systems of illocutionary logic have both an ontological,

### Day 3. Wednesday May 23, Learn the basic building blocks of proofs (specifically, direct proofs)

Day 3 Wednesday May 23, 2012 Objectives: Learn the basics of Propositional Logic Learn the basic building blocks of proofs (specifically, direct proofs) 1 Propositional Logic Today we introduce the concepts

### PART III - Symbolic Logic Chapter 7 - Sentential Propositions

Logic: A Brief Introduction Ronald L. Hall, Stetson University 7.1 Introduction PART III - Symbolic Logic Chapter 7 - Sentential Propositions What has been made abundantly clear in the previous discussion

### Pronominal, temporal and descriptive anaphora

Pronominal, temporal and descriptive anaphora Dept. of Philosophy Radboud University, Nijmegen Overview Overview Temporal and presuppositional anaphora Kripke s and Kamp s puzzles Some additional data

### Surveying Prof. Bharat Lohani Department of Civil Engineering Indian Institute of Technology, Kanpur. Module - 7 Lecture - 3 Levelling and Contouring

Surveying Prof. Bharat Lohani Department of Civil Engineering Indian Institute of Technology, Kanpur Module - 7 Lecture - 3 Levelling and Contouring (Refer Slide Time: 00:21) Welcome to this lecture series

### Definite Descriptions: From Symbolic Logic to Metaphysics. The previous president of the United States is left handed.

Definite Descriptions: From Symbolic Logic to Metaphysics Recall that we have been translating definite descriptions the same way we would translate names, i.e., with constants (lower case letters towards

### Jaakko Hintikka IF LOGIC MEETS PARACONSISTENT LOGIC

Jaakko Hintikka IF LOGIC MEETS PARACONSISTENT LOGIC 1. The uniqueness of IF logic My title might at first seem distinctly unpromising. Why should anyone think that one particular alternative logic could

### Review of Philosophical Logic: An Introduction to Advanced Topics *

Teaching Philosophy 36 (4):420-423 (2013). Review of Philosophical Logic: An Introduction to Advanced Topics * CHAD CARMICHAEL Indiana University Purdue University Indianapolis This book serves as a concise

### In this section you will learn three basic aspects of logic. When you are done, you will understand the following:

Basic Principles of Deductive Logic Part One: In this section you will learn three basic aspects of logic. When you are done, you will understand the following: Mental Act Simple Apprehension Judgment

### Module 02 Lecture - 10 Inferential Statistics Single Sample Tests

Introduction to Data Analytics Prof. Nandan Sudarsanam and Prof. B. Ravindran Department of Management Studies and Department of Computer Science and Engineering Indian Institute of Technology, Madras

### CHAPTER 1 A PROPOSITIONAL THEORY OF ASSERTIVE ILLOCUTIONARY ARGUMENTS OCTOBER 2017

CHAPTER 1 A PROPOSITIONAL THEORY OF ASSERTIVE ILLOCUTIONARY ARGUMENTS OCTOBER 2017 Man possesses the capacity of constructing languages, in which every sense can be expressed, without having an idea how

### What are Truth-Tables and What Are They For?

PY114: Work Obscenely Hard Week 9 (Meeting 7) 30 November, 2010 What are Truth-Tables and What Are They For? 0. Business Matters: The last marked homework of term will be due on Monday, 6 December, at

### Workbook Unit 3: Symbolizations

Workbook Unit 3: Symbolizations 1. Overview 2 2. Symbolization as an Art and as a Skill 3 3. A Variety of Symbolization Tricks 15 3.1. n-place Conjunctions and Disjunctions 15 3.2. Neither nor, Not both

### 15. Russell on definite descriptions

15. Russell on definite descriptions Martín Abreu Zavaleta July 30, 2015 Russell was another top logician and philosopher of his time. Like Frege, Russell got interested in denotational expressions as

### Beyond Symbolic Logic

Beyond Symbolic Logic 1. The Problem of Incompleteness: Many believe that mathematics can explain *everything*. Gottlob Frege proposed that ALL truths can be captured in terms of mathematical entities;

### A Liar Paradox. Richard G. Heck, Jr. Brown University

A Liar Paradox Richard G. Heck, Jr. Brown University It is widely supposed nowadays that, whatever the right theory of truth may be, it needs to satisfy a principle sometimes known as transparency : Any

### Workbook Unit 17: Negated Categorical Propositions

Workbook Unit 17: Negated Categorical Propositions Overview 1 1. Reminder 2 2. Negated Categorical Propositions 2 2.1. Negation of Proposition A: Not all Ss are P 3 2.2. Negation of Proposition E: It is

### Remarks on a Foundationalist Theory of Truth. Anil Gupta University of Pittsburgh

For Philosophy and Phenomenological Research Remarks on a Foundationalist Theory of Truth Anil Gupta University of Pittsburgh I Tim Maudlin s Truth and Paradox offers a theory of truth that arises from

### A Model of Decidable Introspective Reasoning with Quantifying-In

A Model of Decidable Introspective Reasoning with Quantifying-In Gerhard Lakemeyer* Institut fur Informatik III Universitat Bonn Romerstr. 164 W-5300 Bonn 1, Germany e-mail: gerhard@uran.informatik.uni-bonn,de

### Logical Omniscience in the Many Agent Case

Logical Omniscience in the Many Agent Case Rohit Parikh City University of New York July 25, 2007 Abstract: The problem of logical omniscience arises at two levels. One is the individual level, where an

### Digital Logic Lecture 5 Boolean Algebra and Logic Gates Part I

Digital Logic Lecture 5 Boolean Algebra and Logic Gates Part I By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department Outline Introduction. Boolean variables and truth tables. Fundamental

### Logicola Truth Evaluation Exercises

Logicola Truth Evaluation Exercises The Logicola exercises for Ch. 6.3 concern truth evaluations, and in 6.4 this complicated to include unknown evaluations. I wanted to say a couple of things for those

### Semantic Foundations for Deductive Methods

Semantic Foundations for Deductive Methods delineating the scope of deductive reason Roger Bishop Jones Abstract. The scope of deductive reason is considered. First a connection is discussed between the

### KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Patgaon, Ranigate, Guwahati SEMESTER: 1 PHILOSOPHY PAPER : 1 LOGIC: 1 BLOCK: 2

GPH S1 01 KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Patgaon, Ranigate, Guwahati-781017 SEMESTER: 1 PHILOSOPHY PAPER : 1 LOGIC: 1 BLOCK: 2 CONTENTS UNIT 6 : Modern analysis of proposition UNIT 7 : Square

### Philosophical Logic. LECTURE SEVEN MICHAELMAS 2017 Dr Maarten Steenhagen

Philosophical Logic LECTURE SEVEN MICHAELMAS 2017 Dr Maarten Steenhagen ms2416@cam.ac.uk Last week Lecture 1: Necessity, Analyticity, and the A Priori Lecture 2: Reference, Description, and Rigid Designation

### Scott Soames: Understanding Truth

Philosophy and Phenomenological Research Vol. LXV, No. 2, September 2002 Scott Soames: Understanding Truth MAlTHEW MCGRATH Texas A & M University Scott Soames has written a valuable book. It is unmatched

### On the Aristotelian Square of Opposition

On the Aristotelian Square of Opposition Dag Westerståhl Göteborg University Abstract A common misunderstanding is that there is something logically amiss with the classical square of opposition, and that

### A romp through the foothills of logic Session 3

A romp through the foothills of logic Session 3 It would be a good idea to watch the short podcast Understanding Truth Tables before attempting this podcast. (Slide 2) In the last session we learnt how

### Circumscribing Inconsistency

Circumscribing Inconsistency Philippe Besnard IRISA Campus de Beaulieu F-35042 Rennes Cedex Torsten H. Schaub* Institut fur Informatik Universitat Potsdam, Postfach 60 15 53 D-14415 Potsdam Abstract We

### Understanding Truth Scott Soames Précis Philosophy and Phenomenological Research Volume LXV, No. 2, 2002

1 Symposium on Understanding Truth By Scott Soames Précis Philosophy and Phenomenological Research Volume LXV, No. 2, 2002 2 Precis of Understanding Truth Scott Soames Understanding Truth aims to illuminate

### Natural Deduction for Sentence Logic

Natural Deduction for Sentence Logic Derived Rules and Derivations without Premises We will pursue the obvious strategy of getting the conclusion by constructing a subderivation from the assumption of

### Williams on Supervaluationism and Logical Revisionism

Williams on Supervaluationism and Logical Revisionism Nicholas K. Jones Non-citable draft: 26 02 2010. Final version appeared in: The Journal of Philosophy (2011) 108: 11: 633-641 Central to discussion

### 7.1. Unit. Terms and Propositions. Nature of propositions. Types of proposition. Classification of propositions

Unit 7.1 Terms and Propositions Nature of propositions A proposition is a unit of reasoning or logical thinking. Both premises and conclusion of reasoning are propositions. Since propositions are so important,

### Is the law of excluded middle a law of logic?

Is the law of excluded middle a law of logic? Introduction I will conclude that the intuitionist s attempt to rule out the law of excluded middle as a law of logic fails. They do so by appealing to harmony

### Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples Section 1.1 Propositional Logic Page references correspond to locations of Extra Examples icons in the textbook. p.2, icon at

### From Necessary Truth to Necessary Existence

Prequel for Section 4.2 of Defending the Correspondence Theory Published by PJP VII, 1 From Necessary Truth to Necessary Existence Abstract I introduce new details in an argument for necessarily existing

### Nathaniel Goldberg. McTAGGART ON TIME

Logic and Logical Philosophy Volume 13 (2004), 71 76 Nathaniel Goldberg McTAGGART ON TIME Abstract. Contemporary discussions on the nature of time begin with McTaggart, who introduces the distinction between

### Journal of Philosophy, Inc.

Journal of Philosophy, Inc. Implicit Definition Sustained Author(s): W. V. Quine Reviewed work(s): Source: The Journal of Philosophy, Vol. 61, No. 2 (Jan. 16, 1964), pp. 71-74 Published by: Journal of

### A Guide to FOL Proof Rules ( for Worksheet 6)

A Guide to FOL Proof Rules ( for Worksheet 6) This lesson sheet will be a good deal like last class s. This time, I ll be running through the proof rules relevant to FOL. Of course, when you re doing any

### Ramsey s belief > action > truth theory.

Ramsey s belief > action > truth theory. Monika Gruber University of Vienna 11.06.2016 Monika Gruber (University of Vienna) Ramsey s belief > action > truth theory. 11.06.2016 1 / 30 1 Truth and Probability

### LOGIC ANTHONY KAPOLKA FYF 101-9/3/2010

LOGIC ANTHONY KAPOLKA FYF 101-9/3/2010 LIBERALLY EDUCATED PEOPLE......RESPECT RIGOR NOT SO MUCH FOR ITS OWN SAKE BUT AS A WAY OF SEEKING TRUTH. LOGIC PUZZLE COOPER IS MURDERED. 3 SUSPECTS: SMITH, JONES,

### A Solution to the Gettier Problem Keota Fields. the three traditional conditions for knowledge, have been discussed extensively in the

A Solution to the Gettier Problem Keota Fields Problem cases by Edmund Gettier 1 and others 2, intended to undermine the sufficiency of the three traditional conditions for knowledge, have been discussed

### Verification and Validation

2012-2013 Verification and Validation Part III : Proof-based Verification Burkhart Wolff Département Informatique Université Paris-Sud / Orsay " Now, can we build a Logic for Programs??? 05/11/14 B. Wolff

### Logic Appendix: More detailed instruction in deductive logic

Logic Appendix: More detailed instruction in deductive logic Standardizing and Diagramming In Reason and the Balance we have taken the approach of using a simple outline to standardize short arguments,

### Georgia Quality Core Curriculum

correlated to the Grade 8 Georgia Quality Core Curriculum McDougal Littell 3/2000 Objective (Cite Numbers) M.8.1 Component Strand/Course Content Standard All Strands: Problem Solving; Algebra; Computation

### Logic: Deductive and Inductive by Carveth Read M.A. CHAPTER VIII

CHAPTER VIII ORDER OF TERMS, EULER'S DIAGRAMS, LOGICAL EQUATIONS, EXISTENTIAL IMPORT OF PROPOSITIONS Section 1. Of the terms of a proposition which is the Subject and which the Predicate? In most of the

### What Is On The Final. Review. What Is Not On The Final. What Might Be On The Final

What Is On he inal Review Everything that has important! written next to it on the slides Everything that I said was important ECE457 Applied Artificial Intelligence all 27 ecture #14 ECE457 Applied Artificial

### Complications for Categorical Syllogisms. PHIL 121: Methods of Reasoning February 27, 2013 Instructor:Karin Howe Binghamton University

Complications for Categorical Syllogisms PHIL 121: Methods of Reasoning February 27, 2013 Instructor:Karin Howe Binghamton University Overall Plan First, I will present some problematic propositions and

### What is Game Theoretical Negation?

Can BAŞKENT Institut d Histoire et de Philosophie des Sciences et des Techniques can@canbaskent.net www.canbaskent.net/logic Adam Mickiewicz University, Poznań April 17-19, 2013 Outlook of the Talk Classical

### SAVING RELATIVISM FROM ITS SAVIOUR

CRÍTICA, Revista Hispanoamericana de Filosofía Vol. XXXI, No. 91 (abril 1999): 91 103 SAVING RELATIVISM FROM ITS SAVIOUR MAX KÖLBEL Doctoral Programme in Cognitive Science Universität Hamburg In his paper

### When Negation Impedes Argumentation: The Case of Dawn. Morgan Sellers Arizona State University

When Negation Impedes Argumentation: The Case of Dawn Morgan Sellers Arizona State University Abstract: This study investigates one student s meanings for negations of various mathematical statements.

### Anthony P. Andres. The Place of Conversion in Aristotelian Logic. Anthony P. Andres

[ Loyola Book Comp., run.tex: 0 AQR Vol. W rev. 0, 17 Jun 2009 ] [The Aquinas Review Vol. W rev. 0: 1 The Place of Conversion in Aristotelian Logic From at least the time of John of St. Thomas, scholastic

### Logic I or Moving in on the Monkey & Bananas Problem

Logic I or Moving in on the Monkey & Bananas Problem We said that an agent receives percepts from its environment, and performs actions on that environment; and that the action sequence can be based on

### A Discussion on Kaplan s and Frege s Theories of Demonstratives

Volume III (2016) A Discussion on Kaplan s and Frege s Theories of Demonstratives Ronald Heisser Massachusetts Institute of Technology Abstract In this paper I claim that Kaplan s argument of the Fregean

### Lecture 4: Deductive Validity

Lecture 4: Deductive Validity Right, I m told we can start. Hello everyone, and hello everyone on the podcast. This week we re going to do deductive validity. Last week we looked at all these things: have

### The Sea-Fight Tomorrow by Aristotle

The Sea-Fight Tomorrow by Aristotle Aristotle, Antiquities Project About the author.... Aristotle (384-322) studied for twenty years at Plato s Academy in Athens. Following Plato s death, Aristotle left

### 7. Some recent rulings of the Supreme Court were politically motivated decisions that flouted the entire history of U.S. legal practice.

M05_COPI1396_13_SE_C05.QXD 10/12/07 9:00 PM Page 193 5.5 The Traditional Square of Opposition 193 EXERCISES Name the quality and quantity of each of the following propositions, and state whether their