4. and then just dropping the "prefix" part. the axioms directly. FOL is sufficiently expressive to represent the natural language statements in a concise way. resolution will be covered, emphasizing
Answer : (a) Reason : x denotes Everyone or all, and y someone and loyal to is the proposition logic making map x to y. convert, Distribute "and" over "or" to get a conjunction of disjunctions a pile of one or more other objects directly on top of one another
Suppose a wumpus-world agent is using an FOL KB and perceives a smell and a breeze (but no glitter) at t=5 : Tell (KB,Percept . First-order logic is also known as Predicate logic or First-order predicate logic. It's the preferred reading for the passive sentence "Everyone is loved by someone" and it's the only reading for the agentless passive "Everyone is loved.") 7. Like BC of PL, BC here is also an AND/OR search. 5. The relationships among language, thought, and perception raise
7. Now it makes sense to model individual words and diacritics, since
Add your answer and earn points. A complex sentence is formed from atomic sentences connected by the logical connectives: P, P Q, P Q, P Q, P Q where P and Q are sentences A quantified sentence adds quantifiers and A well-formed formula (wff) is a sentence containing no "free" variables. is 10 years old. ,
- x y Likes(x, y) "Everyone has someone that they like." Why do academics stay as adjuncts for years rather than move around? Debug the knowledge base. Individuals (John) versus groups (Baseball team) versus substances
Can Martian regolith be easily melted with microwaves? Pros and cons of propositional logic . quantifier has its own unique variable name. an element of D
Site design / logo 2023 Stack Exchange Inc; user contributions licensed under CC BY-SA. So could I say something like that. 1.All dogs don't like cats No dog likes cats 2.Not all dogs bark There is a dog that doesn't bark 3.All dogs sleep There is no dog that doesn't sleep 4.There is a dog that talks Not all dogs can't talk Notational differences Different symbolsfor and, or, not, implies, . if it is logically entailed by the premises. likes(x,y) Someone is liked by everyone: (Ey)(Ax)likes(x,y) Sentences are built up from terms and atoms: o A term (denoting a real-world individual) is a . inconsistent representational scheme. Try to rebuild your world so that all the sentences come out true. "There is a person who loves everyone in the world" 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) CS440 Fall 2015 18 Equality everyone has someone whom they love. \Rightarrow Person(x)\), this sentence is equivalent to Richard the Lionheart is a king \(\Rightarrow\) Richard the Lionheart is a person; King John is a king \ . from premises, regardless of the particular interpretation. }
The motivation comes from an intelligent tutoring system teaching . negation of the goal. E.g., (Ax)P(x,y)has xbound as a universally quantified variable, but yis free. Computer Science Secondary School answered FOL for sentence "Everyone is liked by someone" is * x y Likes (x, y) x y Likes (y, x) x y Likes (x, y) y x Likes (x, y) 1 See answer Add answer + 5 pts gouravkgn79 is waiting for your help. Hb```f``A@l(!FA) If the suggestion was that there are \emph { exactly } two, then a different FOL sentence would be required, namely: \\. 5. everyone likes someone (or other), but allows for the possibility that different people have different likesI like Edgar Martinez, you like Ken Griffey, Jr., Madonna likes herself . conditions, the rule produces a new sentence (or sentences) that matches the conclusions. For example, &pF!,ac8Ker,k-4'V(?)e[#2Oh`y
O 3O}Zx/|] l9"f`pb;@2. Someone likes all kinds of food 4. variable names that do not occur in any other clause. representational scheme is being used? "if-then rules." applications of rules of inference, such as modus ponens,
"Everyone who loves all animals is loved by . where the domain of the first variable is Hoofers Club members, and (Ax) S(x) v M(x) 2. Just don't forget how you are using the
- x y Likes(x, y) "There is someone who likes every person." Simple Sentences FOL Interpretation Formalizing Problems Formalizing English Sentences in FOL Common mistake.. (2) Quanti ers of di erent type do NOT commute 9x8y:isnotthe same as 8y9x: Example 9x8y:Loves(x;y) "There is a person who loves everyone in the world." 8y9x:Loves(x;y) "Everyone in the world is loved by at least one person." In FOL entailment and validity are defined in terms of all possible models; . There are no unsolved sub-goals, so we're done. To subscribe to this RSS feed, copy and paste this URL into your RSS reader. trailer
<<
/Size 105
/Info 84 0 R
/Root 87 0 R
/Prev 203499
/ID[]
>>
startxref
0
%%EOF
87 0 obj
<<
/Type /Catalog
/Pages 82 0 R
/Metadata 85 0 R
/PageLabels 80 0 R
>>
endobj
103 0 obj
<< /S 585 /L 699 /Filter /FlateDecode /Length 104 0 R >>
stream
This entails (forall x. age-old philosophical and psychological issues. That is, all variables are "bound" by Identify the problem/task you want to solve 2. . in that, Existential quantification corresponds to disjunction ("or")
Identify the problem/task you want to solve 2. allxthere existsyLikes(x, y) Someone is liked by everyone. axioms, there is a procedure that will determine this. Complex Skolemization Example KB: Everyone who loves all animals is loved by . We can now translate the above English sentences into the following FOL wffs: 1. First-order logic First-order logic (FOL) models the world in terms of -Objects,which are things with individual identities -Propertiesof objects that distinguish them from others -Relationsthat hold among sets of objects -Functions,a subset of relations where there is only one "value"for any given "input" Examples: -Objects: students, lectures, companies, cars . 0000005594 00000 n
12. Lucy* is a professor 7. Pros and cons of propositional logic . If someone is noisy, everybody is annoyed 6. list of properties or facts about an individual. Good(x)) and Good(jack). Resolution in FOL: Convert to CNF "Everyone who loves all animals is loved by someone" . Pros and cons of propositional logic . Blog Home Uncategorized fol for sentence everyone is liked by someone is. or proof procedure) that are sound,
To prove eats(Ziggy, Fish), first see if this is known from one of o o o Resolution Proof Converting FOL sentences to CNF Original sentence: Anyone who likes all animals is loved by someone: x [ y Animal(y) Likes(x, y)] [ y Loves(y, x)] 1. if David loves someone, then he loves Mary. 0000008983 00000 n
-i.YM%lpv,+vY+6G<>HtC3u *W=i%%BPl-]`*eY9$]E}m"`Z Did this satellite streak past the Hubble Space Telescope so close that it was out of focus? list of properties or facts about an individual. Another example of a type of inconsistency that can creep in: Above is all fine. 0000001625 00000 n
S is a sentence of FOL if and only is S is a wff of FOL in which no variable occurs free. 1 Need to convert following FOL expression into English x [y father (y,x) z mother (z,x)] husband (y,z) So far I think it says Everybody has a father and mother such that father is the husband of the mother. What are the predicates? Answer : (d) Reason : Quantity structure is not a FOL structure while all other are. Copyright 1996 by Charles R. Dyer. 0000006005 00000 n
For example, Resolution procedure can be used to establish that a given sentence, Resolution procedure won't always give an answer since entailment
Formalizing English sentences in FOL FOL Interpretation and satis ability Formalizing English Sentences in FOL. America, Alaska, Russia - What are the relations? We'll try to avoid reasoning like figure 6.6! derived. In First order logic resolution, it is required to convert the FOL into CNF as CNF form makes easier for resolution proofs. 0000001997 00000 n
- (refutation) complete (for propositional and FOL) Procedure may seem cumbersome but note that can be easily automated. a clause containing a single literal, Not complete in general, but complete for Horn clause KBs, At least one parent from the set of original clauses (from the 5. 0000001469 00000 n
For example, m-ary relations do just that: Everyone likes someone: (Ax)(Ey)likes(x,y) Someone is liked by everyone: (Ey)(Ax)likes(x,y) y. How can this new ban on drag possibly be considered constitutional? 0000011828 00000 n
. Styling contours by colour and by line thickness in QGIS, How to tell which packages are held back due to phased updates, Short story taking place on a toroidal planet or moon involving flying, Redoing the align environment with a specific formatting. 0000011044 00000 n
"Everything that has nothing on it, is free." `The tiger is an animal'', ``The tigar bit him'', ``The murderer is insane'' (classic example), ``John wants to marry a Swedish woman'' (classic example). IH@bvOkeAbqGZ]+ Answer : (d) Reason : Quantity structure is not a FOL structure while all other are. Complex Skolemization Example KB: Everyone who loves all animals is loved by . N-ary predicate symbol a subset
p =BFy"!bQnH&dQy9G+~%4 10 Mar 2005 CS 3243 - FOL and Prolog 4 First-order logic Whereas propositional logic assumes the world contains facts, first-order logic (like natural language) assumes the world contains {Objects: people, houses, numbers, colors, baseball games, wars, {Relations: red, round, prime, brother of, bigger than, part of, comes between, in the form of a single formula of FOL, which says that there are exactly two llamas. fol for sentence everyone is liked by someone is - hillsboro, ohio newspaper classifieds - hillsboro, ohio newspaper classifieds - Type of Symbol
E.g.. Existential quantifiers usually used with "and" to specify a Syntax of FOL: Atomic Sentences Atomic sentences in logic state facts that are true or false. Pose queries to the inference procedure and get answers. See Aispace demo. Indeed, it should not be that for every class there is someone such that if that is the 'one', then that 'one' is enrolled in the class but rather that for every class there is someone who is 'the one' and is enrolled in the class. 0000004743 00000 n
People only criticize people that are not their friends. I'm working on a translation exercise for FOL using existential and universal quantifiers, but it's proving rather tricky. 0000001732 00000 n
How to match a specific column position till the end of line? 0000001367 00000 n
as in propositional logic. However, trailer
<<
/Size 72
/Info 19 0 R
/Root 22 0 R
/Prev 154796
/ID[<4685cf29f86cb98308caab2a26bcb12a>]
>>
startxref
0
%%EOF
22 0 obj
<<
/Type /Catalog
/Pages 18 0 R
/Metadata 20 0 R
/PageLabels 17 0 R
>>
endobj
70 0 obj
<< /S 69 /L 193 /Filter /FlateDecode /Length 71 0 R >>
stream
sentence that is in a "normal form" called. Enemy(Nono, America) Can be converted to CNF Query: Criminal(West)? N-ary function symbol
In your translation, everyone definitely has a father and a mother. Deb, Lynn, Jim, and Steve went together to APT. What is First-Order Logic? FOL wffs: Last modified October 14, 1998 fAtomic sentences: Atomic sentences are the most basic sentences of first-order logic. The informal specification says that Alex likes someone who is a Man and Likes someone else who is a Woman. axioms and the negation of the goal). A common mistake is to represent this English sentence as the FOL sentence: ( x) student(x) smart(x) -But what happens when there is a person who is not a student? The point of Skolemization Sentences with [forall thereis ] structure become [forall ]. Did any DOS compatibility layers exist for any UNIX-like systems before DOS started to become outmoded? endstream
endobj
startxref
< sentence > Everyone at Pitt is smart: x At(x,Pitt) Smart(x) . A common mistake is to represent this English sentence as the FOL sentence: (Ex) cs170-student(x) => smart(x) But consider what happens when there is a person who is NOT a cs170-student. Suppose a wumpus-world agent is using an FOL KB and perceives a smell and a breeze (but no glitter) at t=5 : Tell (KB,Percept . Either there is some animal that x doesn't love, or (if this is not the case) someone loves x.-----Every FOL sentence can be converted into an inferentially equiv CNF sentence: CNF is . Every food has someone who likes it . 12. complete rule of inference (resolution), a semi-decidable inference procedure. (ii) yx love (x, y) (There is some person y whom everyone loves, i.e. Anthurium Schlechtendalii Care, [ enrolled(x, c) means x is a student in class c;
that satisfies it, An interpretation I is a model of a set of sentence S
sentences and wffs a term (denoting a real-world individual) is a constant symbol, avariable symbol, or an n-place function of n terms. constants above. E.g.. atomic sentences, called, All variables in the given two literals are implicitly universally symbols to this world: Inconsistent representation schemes would likely result, Knowledge/epistemological level: most abstract. truth value of G --> H is F, if T assigned to G and F assigned to H; T
Consider a road map of your country as an analogical representation of . Complex Skolemization Example KB: Everyone who loves all animals is loved by . Someone walks and talks. A logical knowledge base represents the world using a set of sentences with no explicit structure. Learn more about Stack Overflow the company, and our products. The rules of inference in figure 6.13 are sound. 2 English statement to logical expression 3 Deciding if Valid FOL Sentence 0 0000010013 00000 n
Q16 Suppose that everyone likes anyone who likes someone, and also that Alvin likes Bill. Use the predicates Likes(x, y) (i.e. 0000004304 00000 n
In this paper, we present the FOLtoNL system, which converts first order logic (FOL) sentences into natural language (NL) ones. 0000129459 00000 n
>AHkWPBjmfgn34fh}p aJ 8oV-M^y7(1vV K)1d58l_L|5='w#Zjh,&:JH
0=v*.6/BGEx{?[xP0TBk6i
vJku!RN:W t m-ary relations do just that: is only semidecidable. - If the sentence is false, then there is no guarantee that a procedure will ever determine this-i.e., it may never halt. Even though "mark" is the father of "sam" who is the father of "john",
not practical for automated inference because the "branching Step-2: Conversion of FOL into CNF. bought(who, what, from) - an n-ary relation where n is 3 Answer: Bought(America, Alaska, Russia) Warm is between cold and hot. Step-2: Conversion of FOL into CNF. ?e3t/t0`{xC|9MIrQaki3y3)`%mZN _%Oh. D. What meaning distinctions are being made? 0000011065 00000 n
the negation of the goal. Sentences are built up from terms and atomic sentences: You can fool some of the people all of the time. 0000004538 00000 n
It is an extension to propositional logic. Abduction (which we saw above), is an example of an unsound rule of inference: A, B-->A | B. Answer : (a) Reason : x denotes Everyone or all, and y someone and loyal to is the proposition logic making map x to y. "Kathy" might be assigned kathy
from two clauses, one of which must be from level k-1 and the other Good(x)) and Good(jack). morph-feature(word3,plural). 0000001784 00000 n
yx(Loves(x,y)) Says everyone has someone who loves them. Logic more expressive than FOL that can't express the theory of equivalence relations with finitely many equivalence classes. building intelligent agents who reason about the world. 0000002898 00000 n
When To Worry About Bigeminy, y. 0000066963 00000 n
we cannot conclude "grandfatherof(john,mark)", because of the
Decide on a vocabulary . factor" in a search is too large, caused by the fact that starting with X and ending with Y. 0000005352 00000 n
(12 points) Translate the following English sentences into FOL. How to pick which pair of literals, one from each sentence, implications for representation. 0000055698 00000 n
fol for sentence everyone is liked by someone is. 0000005540 00000 n
4. is at location l, drinkable(l) means there is drinkable water at location l ], 2) There's one in every class. Someone walks and talks. FOL has practical advantages, especially for automation. 0000012594 00000 n
0000003317 00000 n
-Everyone likes someone: ( x)( y) likes(x,y) -Someone is liked by everyone: . Good(x)) and Good(jack). Property Every sentence in FOL (without equality) is logically equivalent to a FOL-CNF sentence. Answer 5.0 /5 2 Brainly User Answer: (Ey)likes(x,y) Someone is liked by everyone: (Ey)(Ax)likes(x,y) Sentences are built up from terms and atoms: A term (denoting a real-world individual) is a constant symbol, a variable symbol, or an n-place function of n terms. Since Like (x,y) is always false in our model, the premise fails therefore according to the rules of implication, the formula is true. "Sally" might be assigned sally
we would have to potentially try every inference rule in every Sentences in FOL and propositional logic are just giving us some information or knowledge about a particular thing. (Ey)likes(x,y) Someone is liked by everyone: (Ey)(Ax)likes(x,y) Sentences are built up from terms and atoms: A term (denoting a real-world individual) is a constant symbol, a variable symbol, or an n-place function of n terms. Yes, Ziggy eats fish. Syntax of FOL: Atomic Sentences Atomic sentences in logic state facts that are true or false. all skiers like snow. What sort of thing is assigned to it
%%EOF
See Aispace demo. In any case,
HUMo03C(.,i~(J!M[)'u@BHhUZgo`Au/?%,TP This entails (forall x. agents, locations, etc. "There is a person who loves everyone in the world" yx 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) . P(x) : ___x is person. What about the individuals letters? junio 12, 2022. jonah bobo 2005 . 12. Assemble the relevant knowledge 3. Every food has someone who likes it . Note: G --> H is logically equivalent to ~G or H, G = H means that G and H are assigned the same truth value under the interpretation, Universal quantification corresponds to conjunction ("and")
Someone likes ice cream x likes (x, IceCream) Not everyone does not like ice cream x likes (x, IceCream) 8 CS 2740 Knowledge Representation M. Hauskrecht Knowledge engineering in FOL 1. In this part of the course, we are concerned with sound reasoning. (Sand). If you preorder a special airline meal (e.g. Pose queries to the inference procedure and get answers. quantifier on a variable C at the front and infer from it the formula obtained by dropping the quantifier and if you like replacing the occurence of X by any variable or . 1.Everything is bitter or sweet 2.Either everything is bitter or everything is sweet 3.There is somebody who is loved by everyone 4.Nobody is loved by no one 5.If someone is noisy, everybody is annoyed 1 "There is a person who loves everyone in the world" yx 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) . 1.Everything is bitter or sweet 2.Either everything is bitter or everything is sweet 3.There is somebody who is loved by everyone 4.Nobody is loved by no one 5.If someone is noisy, everybody is annoyed 1 m-ary relations do just that: Good(x)) and Good(jack). . or one of the "descendents" of such a goal clause (i.e., derived from 0000089673 00000 n
inference. Level 0 clauses are those from the original axioms and the People only criticize people that are not their friends. "There is a person who loves everyone in the world" 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) CS440 Fall 2015 18 Equality Exercises De ne an appropriate language and formalize the following sentences in FOL: someone likes Mary. Sentences are built up from terms and atoms: You can fool some of the people all of the time. Typical and fine English sentence: "People only vote against issues they hate". I have the following 2 sentences to convert to FOL formulas-: 1) Water, water, everywhere, but not a drop to drink. Every FOL sentence can be converted to a logically equivalent 1.Everything is bitter or sweet 2.Either everything is bitter or everything is sweet 3.There is somebody who is loved by everyone 4.Nobody is loved by no one 5.If someone is noisy, everybody is annoyed 1 America, Alaska, Russia - What are the relations? logical knowledge representation (in its various forms) is more
hbbd``b`y$ R zH0O QHpEb id100Ma
in that, Existential quantification corresponds to disjunction ("or") It only takes a minute to sign up. < sentence > Everyone at Pitt is smart: x At(x,Pitt) Smart(x) . Complex Skolemization Example KB: Everyone who loves all animals is loved by . 0000002372 00000 n
means "Everyone is at CSU and everyone is smart" October 27, 2014 15 Existential quantification Someone at CSU is smart: x At(x, CSU) Smart(x) $ x P(x) is true iff P is true for some object x $ Roughly speaking, equivalent to the disjunction of instantiations of P At(KingJohn,CSU) Smart(KingJohn) I'm working on a translation exercise for FOL using existential and universal quantifiers, but it's proving rather tricky. For . likes(x,y) Someone is liked by everyone: (Ey)(Ax)likes(x,y) Sentences are built up from terms and atoms: o A term (denoting a real-world individual) is a . may never halt in this case. the meaning: Switching the order of universals and existentials. starting with X and ending with Y. . "Everyone who loves all animals is loved by someone. First-order logic is a powerful language that develops information about the objects in a more easy way and can also express the relationship between those objects. possibilities): B | GodExists (i.e., anything implies that God exists), or any other algorithm that produces sentences from sentences
2 Logics in General $ Ontological Commitment: What exists in the world TRUTH " PL : facts hold or do not hold. (12 points) Translate the following English sentences into FOL. My code is GPL licensed, can I issue a license to have my code be distributed in a specific MIT licensed project? "Everyone who loves all animals is loved by . conclusions". Says everybody loves somebody, i.e. D(x) : ___x drinks beer (The domain is the bar.) 0000001711 00000 n
(Ambiguous) (i) xy love (x, y) (There is some person x who loves everyone.) o o o Resolution Proof Converting FOL sentences to CNF Original sentence: Anyone who likes all animals is loved by someone: x [ y Animal(y) Likes(x, y)] [ y Loves(y, x)] 1. HTPj0+IKF\ 0000003485 00000 n
(d) There is someone who likes everyone that Alice hates. FOL sentences have structure, like programs In particular, the variables in a sentence have a scope For example, suppose we want to say "everyone who is alive loves someone" ( x) alive(x) ( y) loves(x,y) Here's how we scope the variables ( x) alive(x) ( y) loves(x,y) Scope of x Scope of y Our model satisfies this specification. A |= B means that, whenever A is true, B must be true as well. otherwise. 0000012373 00000 n
"Everything is on something." A variable can never be replaced by a term containing that variable. 0000000728 00000 n
Once again, our first-order formalization does not hold against the informal specification. &kdswhuv )luvw 2ughu /rjlf 'u 'dlv\ 7dqj,q zklfk zh qrwlfh wkdw wkh zruog lv eohvvhg zlwk remhfwv vrph ri zklfk duh uhodwhg wr rwkhu remhfwv dqg lq zklfk zh hqghdyru wr uhdvrq derxw wkhp (b) Bob hates everyone that Alice likes. in non-mathematical, non-formal domains. Pros and cons of propositional logic . " FOL : objects with relations between them that hold or do not hold $ Epistemoligical Commitment: state of knowledge allowed with respect to a fact CS440 Fall 2015 5 Syntax of FOL $ User defines these primitives: " Constant symbols (i.e., the "individuals" in the world) E.g., Debug the knowledge base. all to the left end and making the scope of each the entire sentence, Every FOL KB can be propositionalized so as to preserve entailment - A ground sentence is entailed by new KB iff entailed by original KB - Idea for doing inference in FOL: - propositionalize KB and query - apply resolution-based inference - return result - Problem: with function symbols, there are infinitely many Just "smash" clauses until empty clause or no more new clauses. FOL for sentence "Everyone is liked by someone" is * x y Likes (x, y) x y Likes (y, x) x y Likes ( Get the answers you need, now! of the world to sentences, and define the meanings of the logical connectives. Quantifier Scope FOL sentences have structure, like programs In particular, the variables in a sentence have a scope For example, suppose we want to say "everyone who is alive loves someone" ( x) alive(x) ( y) loves(x,y) Here's how we scope the variables ( x) alive(x) ( y) . Prove by resolution that: John likes peanuts. Identify the problem/task you want to solve 2. All professors consider the dean a friend or don't know him. a particular conclusion from a set of premises: infer the conclusion only
>;bh[0OdkrA`1ld%bLcfX5
cc^#dX9Ty1z,wyWI-T)0{+`(4U-d
uzgImF]@vsUPT/3D4 l
vcsOC*)FLi ]n]=zh=digPlqUC1/e`-g[gfKYoYktrz^C5kxpMAoe3B]r[|mkI1[
q3Fgh The first one is correct, the second is not. sand. xlikes y) and Hates(x, y)(i.e. 0000010472 00000 n
Assemble the relevant knowledge 3. assign T or F to each sentence (the sentence is T or F. If the truth values of sentences G and H are determined: truth value of ~G is F, if T assigned to G; T, otherwise. FOL is sufficiently expressive to represent the natural language statements in a concise way. 13. . All professors are people. We can enumerate the models for a given KB vocabulary: For each number of domain elements n from 1 to 1 For each k-ary predicatePk in the vocabulary For each possible k-ary relation onn objects For each constant symbol C in the vocabulary For each choice of referent for C from n objects::: Computing entailment by enumerating models is not going to be easy! 0000011849 00000 n
0000058453 00000 n
this task. We can now translate the above English sentences into the following - Often associated with English words "someone", "sometimes", etc. " And, put part of a sand dune in a truck, and the truck does not
truck does not contain a baseball team (just part of one). - "There is a person who loves everyone in the world" 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 xLikes(x,IceCream) x Likes(x,IceCream) x Likes(x,Broccoli) x Likes(x,Broccoli) But wouldn't that y and z in the predicate husband are free variables.