Roorkee College of Engineering was launched and promoted by chartered Accountant S.K. Gupta in 2010 with a view to provide high quality technical education to the regional aspirants in general and localite rural poor in particular.
Our infrastructure, facilities, teaching methodologies & academic make sure that RCE retains a special place in the academic landscape of northern India and in the hearts of those who live, study & teach here. RCE emphasizes on emerging technologies, innovative thinking, teamwork, entrepreneurship, overall development and the importance of partnerships and global outlook. Our students are sought after by employers, and making a difference in our cities and communities for well over a decade now. We at RCE are forever committed to help you realize your career ambitions & unlock your true potential.
A campus with good infrastructure, coached by highly distinguished faculty using the latest teaching aids, excellent hostel facilities, and a vision that drives us to ensure imparting wholesome technical education to our students, is what sets us apart from the run-of-the-mill engineering collages spread all over the country.

Comments

Posting comment...

Premium member

Presentation Transcript

Slide1:

Logic

Slide2:

2 What is logic? Logic is an “algebra” for manipulating only two values: true ( T ) and false ( F ) Nevertheless, logic can be quite challenging This talk will cover: Propositional logic--the simplest kind Predicate logic (predicate calculus)--an extension of propositional logic Resolution theory--a general way of doing proofs in predicate logic Possibly: Conversion to clause form Possibly: Other logics (just to make you aware that they exist)

Slide3:

Propositional logic

Slide4:

4 Propositional logic Propositional logic consists of: The logical values true and false ( T and F ) Propositions : “Sentences,” which Are atomic (that is, they must be treated as indivisible units, with no internal structure), and Have a single logical value, either true or false Operators , both unary and binary; when applied to logical values, yield logical values The usual operators are and , or , not , and implies

Slide5:

5 Truth tables Logic, like arithmetic, has operators , which apply to one, two, or more values ( operands ) A truth table lists the results for each possible arrangement of operands Order is important: x op y may or may not give the same result as y op x The rows in a truth table list all possible sequences of truth values for n operands, and specify a result for each sequence Hence, there are 2 n rows in a truth table for n operands

Slide6:

6 Unary operators X Constant true, (T) T T F T There are four possible unary operators: Only the last of these (negation) is widely used (and has a symbol, ¬ ,for the operation X Constant false, (F) T F F F X Identity, (X) T T F F X Negation, ¬ X T F F T

Slide7:

7 Combined tables for unary operators X Constant T Constant F Identity ¬ X T T F T F F T F F T

Slide8:

8 Binary operators There are sixteen possible binary operators: All these operators have names, but I haven’t tried to fit them in Only a few of these operators are normally used in logic X Y T T T T T T T T T T F F F F F F F F T F T T T T F F F F T T T T F F F F F T T T F F T T F F T T F F T T F F F F T F T F T F T F T F T F T F T F

Slide9:

9 Useful binary operators Here are the binary operators that are traditionally used: Notice in particular that material implication ( ) only approximately means the same as the English word “implies” All the other operators can be constructed from a combination of these (along with unary not , ¬ ) X Y AND X Y OR X Y IMPLIES X Y BICONDITIONAL X Y T T T T T T T F F T F F F T F T T F F F F F T T

Slide10:

10 Logical expressions All logical expressions can be computed with some combination of and ( ), or ( ), and not ( ) operators For example, logical implication can be computed this way: Notice that X Y is equivalent to X Y X Y X X Y X Y T T F T T T F F F F F T T T T F F T T T

Slide11:

11 Another example Exclusive or ( xor ) is true if exactly one of its operands is true Notice that ( X Y) (X Y) is equivalent to X xor Y X Y X Y X Y X Y ( X Y) (X Y) X xor Y T T F F F F F F T F F T F T T T F T T F T F T T F F T T F F F F

Slide12:

12 Worlds A world is a collection of prepositions and logical expressions relating those prepositions Example: Propositions: JohnLovesMary , MaryIsFemale , MaryIsRich Expressions: MaryIsFemale MaryIsRich JohnLovesMary A proposition “says something” about the world, but since it is atomic (you can’t look inside it to see component parts), propositions tend to be very specialized and inflexible

Slide13:

13 Models A model is an assignment of a truth value to each proposition, for example: JohnLovesMary: T , MaryIsFemale: T , MaryIsRich: F An expression is satisfiable if there is a model for which the expression is true For example, the above model satisfies the expression MaryIsFemale MaryIsRich JohnLovesMary An expression is valid if it is satisfied by every model This expression is not valid: MaryIsFemale MaryIsRich JohnLovesMary because it is not satisfied by this model: JohnLovesMary: F , MaryIsFemale: T , MaryIsRich: T But this expression is valid: MaryIsFemale MaryIsRich MaryIsFemale

Slide14:

14 Inference rules in propositional logic Here are just a few of the rules you can apply when reasoning in propositional logic: From aima.eecs.berkeley.edu/slides-ppt, chs 7-9

Slide15:

15 Implication elimination A particularly important rule allows you to get rid of the implication operator, : X Y X Y We will use this later on as a necessary tool for simplifying logical expressions The symbol means “is logically equivalent to”

Slide16:

16 Conjunction elimination Another important rule for simplifying logical expressions allows you to get rid of the conjunction ( and ) operator, : This rule simply says that if you have an and operator at the top level of a fact (logical expression), you can break the expression up into two separate facts: MaryIsFemale MaryIsRich becomes: MaryIsFemale MaryIsRich

Slide17:

17 Inference by computer To do inference (reasoning) by computer is basically a search process, taking logical expressions and applying inference rules to them Which logical expressions to use? Which inference rules to apply? Usually you are trying to “prove” some particular statement Example: it_is_raining it_is_sunny it_is_sunny I_stay_dry it_is_rainy I_take_umbrella I_take_umbrella I_stay_dry To prove: I_stay_dry

Slide18:

18 Forward and backward reasoning Situation: You have a collection of logical expressions ( premises ), and you are trying to prove some additional logical expression (the conclusion ) You can: Do forward reasoning : Start applying inference rules to the logical expressions you have, and stop if one of your results is the conclusion you want Do backward reasoning : Start from the conclusion you want, and try to choose inference rules that will get you back to the logical expressions you have With the tools we have discussed so far, neither is feasible

Slide19:

19 Example Given: it_is_raining it_is_sunny it_is_sunny I_stay_dry it_is_raining I_take_umbrella I_take_umbrella I_stay_dry You can conclude: it_is_sunny it_is_raining I_take_umbrella it_is_sunny I_stay_dry I_take_umbrella Etc., etc. ... there are just too many things you can conclude!

Slide20:

Predicate Calculus

Slide21:

21 Predicate calculus Predicate calculus is also known as “ First Order Logic ” ( FOL ) Predicate calculus includes: All of propositional logic Logical values true , false Variables x , y , a , b ,... Connectives , , , , Constants KingJohn , 2 , Villanova ,... Predicates Brother , > ,... Functions Sqrt , MotherOf ,... Quantifiers ,

Slide22:

22 Constants, functions, and predicates A constant represents a “thing”--it has no truth value, and it does not occur “bare” in a logical expression Examples: DavidMatuszek , 5 , Earth , goodIdea Given zero or more arguments, a function produces a constant as its value: Examples: motherOf(DavidMatuszek) , add(2, 2) , thisPlanet() A predicate is like a function, but produces a truth value Examples: greatInstructor(DavidMatuszek) , isPlanet(Earth) , greater(3, add(2, 2))

Slide23:

23 Universal quantification The universal quantifier, , is read as “for each” or “for every” Example: x, x 2 0 (for all x, x 2 is greater than or equal to zero) Typically, is the main connective with : x, at(x,Villanova) smart(x) means “Everyone at Villanova is smart” Common mistake: using as the main connective with : x, at(x,Villanova) smart(x) means “Everyone is at Villanova and everyone is smart” If there are no values satisfying the condition, the result is true Example: x, isPersonFromMars(x) smart(x) is true

Slide24:

24 Existential quantification The existential quantifier, , is read “for some” or “there exists” Example: x, x 2 < 0 (there exists an x such that x 2 is less than zero) Typically, is the main connective with : x, at(x,Villanova) smart(x) means “There is someone who is at Villanova and is smart” Common mistake: using as the main connective with : x, at(x,Villanova) smart(x) This is true if there is someone at Villanova who is smart... ...but it is also true if there is someone who is not at Villanova By the rules of material implication, the result of F T is T

Slide25:

25 Properties of quantifiers x y is the same as y x x y is the same as y x x y is not the same as y x x y Loves(x,y) “There is a person who loves everyone in the world” More exactly: x y (person(x) person(y) Loves(x,y)) y x Loves(x,y) “Everyone in the world is loved by at least one person” Quantifier duality : each can be expressed using the other x Likes(x,IceCream) x Likes(x,IceCream) x Likes(x,Broccoli) x Likes(x,Broccoli) From aima.eecs.berkeley.edu/slides-ppt, chs 7-9

Slide26:

26 Parentheses Parentheses are often used with quantifiers Unfortunately, everyone uses them differently, so don’t be upset at any usage you see Examples: ( x) person(x) likes(x,iceCream) ( x) (person(x) likes(x,iceCream)) ( x) [ person(x) likes(x,iceCream) ] x, person(x) likes(x,iceCream) x (person(x) likes(x,iceCream)) I prefer parentheses that show the scope of the quantifier x (x > 0) x (x < 0)

Slide27:

27 More rules Now there are numerous additional rules we can apply! Here are two exceptionally important rules: x, p(x) x, p(x) “If not every x satisfies p(x) , then there exists a x that does not satisfy p(x) ” x, p(x) x, p(x) “If there does not exist an x that satisfies p(x) , then all x do not satisfy p(x) ” In any case, the search space is just too large to be feasible This was the case until 1970, when J. Robinson discovered resolution

Slide28:

28 Interlude: Definitions syntax : defines the formal structure of sentences semantics : determines the truth of sentences wrt (with respect to) models entailment : one statement entails another if the truth of the first means that the second must also be true inference : deriving sentences from other sentences soundness : derivations produce only entailed sentences completeness : derivations can produce all entailed sentences

Slide29:

Resolution

Slide30:

30 Logic by computer was infeasible Why is logic so hard? You start with a large collection of facts (predicates) You start with a large collection of possible transformations (rules) Some of these rules apply to a single fact to yield a new fact Some of these rules apply to a pair of facts to yield a new fact So at every step you must: Choose some rule to apply Choose one or two facts to which you might be able to apply the rule If there are n facts There are n potential ways to apply a single-operand rule There are n * (n - 1) potential ways to apply a two-operand rule Add the new fact to your ever-expanding fact base The search space is huge!

Slide31:

31 The magic of resolution Here’s how resolution works: You transform each of your facts into a particular form, called a clause (this is the tricky part) You apply a single rule, the resolution principle , to a pair of clauses Clauses are closed with respect to resolution--that is, when you resolve two clauses, you get a new clause You add the new clause to your fact base So the number of facts you have grows linearly You still have to choose a pair of facts to resolve You never have to choose a rule, because there’s only one

Slide32:

32 The fact base A fact base is a collection of “facts,” expressed in predicate calculus, that are presumed to be true (valid) These facts are implicitly “ and ed” together Example fact base: seafood(X) likes(John, X) (where X is a variable) seafood(shrimp) pasta(X) likes(Mary, X) (where X is a different variable) pasta(spaghetti) That is, (seafood(X) likes(John, X)) seafood(shrimp) (pasta( Y ) likes(Mary, Y )) pasta(spaghetti) Notice that we had to change some X s to Y s The scope of a variable is the single fact in which it occurs

Slide33:

33 Clause form A clause is a disjunction (" or ") of zero or more literals, some or all of which may be negated Example: sinks(X) dissolves(X, water) ¬denser(X, water) Notice that clauses use only “or” and “not”—they do not use “and,” “implies,” or either of the quantifiers “for all” or “there exists” The impressive part is that any predicate calculus expression can be put into clause form Existential quantifiers, , are the trickiest ones

Slide34:

34 Unification From the pair of facts (not yet clauses, just facts): seafood(X) likes(John, X) (where X is a variable) seafood(shrimp) We ought to be able to conclude likes(John, shrimp) We can do this by unifying the variable X with the constant shrimp This is the same “unification” as is done in Prolog This unification turns seafood(X) likes(John, X) into seafood(shrimp) likes(John, shrimp) Together with the given fact seafood(shrimp) , the final deductive step is easy

Slide35:

35 The resolution principle Here it is: From X someLiterals and X someOtherLiterals ---------------------------------------------- conclude: someLiterals someOtherLiterals That’s all there is to it! Example: broke(Bob) well-fed(Bob) ¬broke(Bob) ¬hungry(Bob) -------------------------------------- well-fed(Bob) ¬hungry(Bob)

Slide36:

36 A common error You can only do one resolution at a time Example: broke(Bob) well-fed(Bob) happy(Bob) ¬broke(Bob) ¬hungry(Bob) ∨ ¬happy(Bob) You can resolve on broke to get: well-fed(Bob) happy(Bob) ¬hungry(Bob) ¬happy(Bob) T Or you can resolve on happy to get: broke(Bob) well-fed(Bob) ¬broke(Bob) ¬hungry(Bob) T Note that both legal resolutions yield a tautology (a trivially true statement, containing X ¬X ), which is correct but useless But you cannot resolve on both at once to get: well-fed(Bob) ¬hungry(Bob)

Slide37:

37 Contradiction A special case occurs when the result of a resolution (the resolvent ) is empty, or “NIL” Example: hungry(Bob) ¬hungry(Bob) ---------------- NIL In this case, the fact base is inconsistent This will turn out to be a very useful observation in doing resolution theorem proving

Slide38:

38 A first example “Everywhere that John goes, Rover goes. John is at school.” at(John, X) at(Rover, X) (not yet in clause form) at(John, school) (already in clause form) We use implication elimination to change the first of these into clause form: at(John, X) at(Rover, X) at(John, school) We can resolve these on at(-, -), but to do so we have to unify X with school ; this gives: at(Rover, school)

Slide39:

39 Refutation resolution The previous example was easy because it had very few clauses When we have a lot of clauses, we want to focus our search on the thing we would like to prove We can do this as follows: Assume that our fact base is consistent (we can’t derive NIL ) Add the negation of the thing we want to prove to the fact base Show that the fact base is now inconsistent Conclude the thing we want to prove

Slide40:

40 Example of refutation resolution “Everywhere that John goes, Rover goes. John is at school. Prove that Rover is at school. ” at(John, X) at(Rover, X) at(John, school) at(Rover, school) (this is the added clause) Resolve #1 and #3: at(John, X) Resolve #2 and #4: NIL Conclude the negation of the added clause: at(Rover, school) This seems a roundabout approach for such a simple example, but it works well for larger problems

Conversion to clause form A nine-step process Reference: Artificial Intelligence , by Elaine Rich and Kevin Knight

Slide43:

43 Running example All Romans who know Marcus either hate Caesar or think that anyone who hates anyone is crazy x, [ Roman(x) know(x, Marcus) ] [ hate(x, Caesar) ( y, z, hate(y, z) thinkCrazy(x, y))]

Slide44:

44 Step 1: Eliminate implications Use the fact that x y is equivalent to x y x, [ Roman(x) know(x, Marcus) ] [ hate(x, Caesar) ( y, z, hate(y, z) thinkCrazy(x, y))] x, [ Roman(x) know(x, Marcus) ] [hate(x, Caesar) ( y, ( z, hate(y, z) thinkCrazy(x, y))]

Slide45:

45 Step 2: Reduce the scope of Reduce the scope of negation to a single term, using: ( p) p (a b) ( a b) (a b) ( a b) x, p(x) x, p(x) x, p(x) x, p(x) x, [ Roman(x) know(x, Marcus) ] [hate(x, Caesar) ( y, ( z, hate(y, z) thinkCrazy(x, y))] x, [ Roman(x) know(x, Marcus) ] [hate(x, Caesar) ( y, z, hate(y, z) thinkCrazy(x, y))]

Slide46:

46 Step 3: Standardize variables apart x, P(x) x, Q(x) becomes x, P(x) y, Q(y) This is just to keep the scopes of variables from getting confused Not necessary in our running example

Slide47:

47 Step 4: Move quantifiers Move all quantifiers to the left, without changing their relative positions x, [ Roman(x) know(x, Marcus) ] [hate(x, Caesar) ( y, z, hate(y, z) thinkCrazy(x, y)] x, y, z,[ Roman(x) know(x, Marcus) ] [hate(x, Caesar) ( hate(y, z) thinkCrazy(x, y))]

Slide48:

48 Step 5: Eliminate existential quantifiers We do this by introducing Skolem functions : If x, p(x) then just pick one; call it x’ If the existential quantifier is under control of a universal quantifier, then the picked value has to be a function of the universally quantified variable: If x, y, p(x, y) then x, p(x, y(x)) Not necessary in our running example

Slide49:

49 Exercise Convert the following in to skolem form u v x y P(f(u), v, x, y) Q(u, v, y)

Slide50:

50 Step 6: Drop the prefix (quantifiers) x, y, z,[ Roman(x) know(x, Marcus) ] [hate(x, Caesar) ( hate(y, z) thinkCrazy(x, y))] At this point, all the quantifiers are universal quantifiers We can just take it for granted that all variables are universally quantified [ Roman(x) know(x, Marcus) ] [hate(x, Caesar) ( hate(y, z) thinkCrazy(x, y))]

52 Step 8: Create separate clauses Every place we have an , we break our expression up into separate pieces Not necessary in our running example

Slide53:

53 Step 9: Standardize apart Rename variables so that no two clauses have the same variable Not necessary in our running example Final result: Roman(x) know(x, Marcus) hate(x, Caesar) hate(y, z) thinkCrazy(x, y) That’s it! It’s a long process, but easy enough to do mechanically

Slide54:

54 Exercise Convert the following into clausal form x y ( z P(f(x), y, z) ( u Q(x, u) & v R(y, v)))

You do not have the permission to view this presentation. In order to view it, please
contact the author of the presentation.

Send to Blogs and Networks

Processing ....

Premium member

Use HTTPs

HTTPS (Hypertext Transfer Protocol Secure) is a protocol used by Web servers to transfer and display Web content securely. Most web browsers block content or generate a “mixed content” warning when users access web pages via HTTPS that contain embedded content loaded via HTTP. To prevent users from facing this, Use HTTPS option.