QUESTION 6 Translate the English sentence "All web pages owned by Ernest have a link to a page that is about chess." into predicate logic. Assume that the universe of discourse of all variables is all Web pages. For the predicates let Loxy) be "x links to y". Oxy) be "x owns y," and A(x,y) be "x is about y." VxVy(O(Ernest, x)+(L(x,y) A A(y, chess))) O Vx3y(O(Ernest, x)→ (L(x,y) A A(y, chess))) Vx3y(0(Ernest, x)A (L(x.v) ^ A(y, chess))) 3x3y(0(Ernest, x) ^ (L(x,y) ^ A(y. chess))) O

QUESTION 6 Translate the English sentence "All web pages owned by Ernest have a link to a page that is about chess." into predicate logic. Assume that the universe of discourse of all variables is all Web pages. For the predicates let Loxy) be "x links to y". Oxy) be "x owns y," and A(x,y) be "x is about y." VxVy(O(Ernest, x)+(L(x,y) A A(y, chess))) O Vx3y(O(Ernest, x)→ (L(x,y) A A(y, chess))) Vx3y(0(Ernest, x)A (L(x.v) ^ A(y, chess))) 3x3y(0(Ernest, x) ^ (L(x,y) ^ A(y. chess))) O

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Prove the following argument. Be sure to define predicates that you use. The domain is all people. Please indicate the law or rule being used. Everyone who likes football and lives in Seattle likes the Seahawks. Only the people who live in Seattle like the Mariners. Ella likes the Mariners but not the Seahawks. Therefore, there is at least one person who lives in Seattle that does not like football. P(x): x likes football Q(x): x lives in Seattle R(x): x likes the Seahawks S(x): x likes the mariners
Using the predicate symbols shown and the appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) D(x): x is a day S(x): x is sunny R(x): x is rainy M: Monday T: Tuesday Some days are not rainy. which one from this group of answes is the right one a. (∀x)(D(x) ∧ [R(x)]') b. (∀x)(D(x) → [R(x)]') c. (∃x)(D(x) → [R(x)]') d. (∃x)(D(x) ∧ [R(x)]')
Let the domain be the set of all employees of a certain company and Joshua is an employee of that company. Define the following predicates: • P(x) : x was sick yesterday. W(x) : x went to work yesterday. • Q(x) : x was on vacation yesterday. Translate each of the following English statements into a logical expression. 1. Everyone who was well went to work yesterday. 2. Someone who was sick yesterday did not go to work yesterday. 3. Someone who missed work was neither sick nor on vacation. 4. Joshua was on vacation yesterday and he did not go to work. 5. Everyone was well and went to work yesterday.
Let we have these predicates B(x,y)= Brothers, S= Siblings, L (x,y)= Love. Write these sentences using predicate logic (Subject: Artificial Intelligence) Ali and Umar are brothers Brothers are siblings Everybody loves somebody vi. There is someone who is loved by everyone.
8. Let the universe of discourse be U = {−2,−1, 0, 1, 2}. Compute the negations for each of thefollowing statements, via transforming the negation connectives inward, such that the negationsymbols immediately precede predicates. Thereafter, determine whether each of the negatedstatement is true or false. Note that x and y range over U.(a) ∀x∃y(x + y = 1).(b) ∃x∀y(x + y = −y).(c) ∀x∃y(xy ≥ y).(d) ∃x∀y(x ≤ y).
Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.)L(x): x is a lionR(x): x roarsP(x): x is a predatorZ(x): x is a zebraE(x, y): x eats ya. All lions are predators.b. Some lions roar.c. Only lions roar.d. Some lions eat all zebras.e. All lions eat all zebras.
Let p, q and r be propositions: p: Jasper has sore eyes q: Jasper misses the last day of the board exam r: Jasper passes the board exam Write the following propositions in terms of the given connectives: a.) q→¬r b.) q ↔ p c.) p → q ⋀ ¬r
Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.)J(x): x is a judgeL(x): x is a lawyerW(x): x is a womanC(x): x is a chemistA(x, y): x admires ya. There are some women lawyers who are chemists.b. No woman is both a lawyer and a chemist.c. Some lawyers admire only judges.d. All judges admire only judges.e. Only judges admire judges.f. All women lawyers admire some judge.g. Some women admire no lawyer.
Let B(x) be the statement "X is a ball", R(x) be the statement "X is round and let S(x) be the statements "X is a soccer ball" where the domain consists of the whole world. Write the following sentences using predicates and qunitifiers: d) Every soccer ball is round e) A soccer ball is roundUser A for the universal quantifier symbol and E for the existential quantifier symbol
Using the predicate symbols shown and the appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) D(x): x is a day S(x): x is sunny R(x): x is rainy M: Monday T: Tuesday All days are sunny. which of these answers are right? a. (∀x)[D(x) ∧ S(x)] b. (∀x)[D(x) → S(x)] c. (∃x)[D(x) ∧ S(x)] d. (∃x)[D(x) → S(x)
1. Teachers in the Middle Ages supposedly tested the real-time propositional logic ability of a student via a technique known as an obligato game. In an obligato game, a number of rounds is set and in each round the teacher gives the student successive assertions that the student must either accept or reject as they are given. When the student accepts an assertion, it is added as a commitment; when the student rejects an assertion its negation is added as a commitment. The student passes the test if the consistency of all commitments is maintained throughout the test. a.) Suppose that in a three-round obligato game, the teacher first gives the student the proposition p → q, then the proposition ¬(p ∨ r) ∨ q, and finally the proposition q. For which of the eight possible sequences of three answers will the student pass the test? b.) Explain why every obligato game has a winning strategy.
Let L(X) be the statement " X visited London", let P(X) be the statement " X visited Paris" and let N(X) be the statement " X visited New York". Express the statement “None of your friends visited London, Paris and New York.” in terms of C(X), D(X), F(X), quantifiers, and logical connectives where the domain consists of all your friends.