Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
PLEASE TYPE ANSWER
Exercise 1.7.4: Translating quantified statements from English to logic, part 3.
In the following question, the domain is a set of employees who work at a company. Ingrid is one of the employees at the company. Define the following predicates:
- S(x): x was sick yesterday
- W(x): x went to work yesterday
- V(x): x was on vacation yesterday
Translate the following English statements into a logical expression with the same meaning.
(d)
Yesterday someone was sick and went to work.
(e)
Everyone who did not go to work yesterday was sick.
(f)
Everyone who missed work was sick or on vacation (or both).
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Please answer the question 4, 5, 6arrow_forwardConvert each of the following argu- ments into formal statements, e.g., define sentences existentially and/or universally quantified statements. Then determine which rules of logic have been applied and explain whether or not they have been ap- plied correctly. if you do the homework you will pass the final. Somebody did not pass the final. Therefore somebody did not not do the homework. If you do the homework you will pass the final. Curly did not do the homework. Therefore Curly will not pass the final. If you don’t do the homework, you won’t pass the final. Moe did the homework. Therefore Moe passed the final.arrow_forwardSuppose that: • variable X can represent any creature, • the predicate tove(X) is true if and only if X is a tove, • the predicate slithy(X) is true if and only if X is slithy, and • the function action(X) is a function that returns the kind of action that X is able to perform. Write a statement in predicate logic with the following meaning: "Any tove that can gyre or gimble must also be slithy." The following symbols are provided for you to copy if you wish (though not many of them are needed in this question, and you are not limited to using only the symbols that are listed here): 3 V A V ¬ A → € e ± Answer:arrow_forward
- Tanslate each of these statements into logical expressions using predicates, quan-tifiers, and logical connectives. A) Not all cats can jump high. Assume the domain is all animals. B) Some cats hate all dogs. Assume the domain is all animals. C) No drivers obey the speed limit if they are in a hurry. Assume the domain is allpeople.arrow_forwardI will thumbs up if you answer all. please convert FOL to CNF Convert each of the following English statements into a single first-order logic sentence using the following constants and predicates. •Constants: Apples, Oranges, Chess, Go, John, Mary. •Predicates: oLikes(x,y): person x likes food y oPlays(x,y): person x plays game y a.If a personlikesApples, then they play chess. b.If a person likesOranges, then they play Go. c.A person likesApples or Oranges, but not both. d.John likes apples. e.Mary does not like anything that John likes. and then: Convert each of the first-order logic sentences in Problem 2to conjunctive normal form (CNF). There is no need to show intermediate steps. Assign each clause number: C1, C2, etc.arrow_forward4. Briefly explain the difference between a singular term and a predicate.arrow_forward
- Develop a system/application in Prolog that will allow grader to: load a set of student’s grades (see samples from the Table C below) query student’s final letter grade (A, B, C, etc.) by a given student’s name. query student(s) whose grade matches to the input letter grade (e.g., A). For example, show student(s) whose final letter grade is A. There are 3 types of grades for each student—HWs, Exams, and Project, with a weight of 20%, 40% and 40%, respectively, to the 100-point final. Table A and B show how the final grades (in points and letter) are computed. Table C shows samples of students’ grades. You will define the execution instructions to answer the following questions so that grader can test out your application in Prolog: how to load your source code to Prolog runtime/compiler how to load students’ grades to Prolog runtime/compiler how to query student’s letter grade how to query student(s) whose letter grade matches to an input letter grade Please DO NOT hard code any…arrow_forwardUsing the predicate symbols shown and the appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) B(x): x is a bee. F(x): x is a flower. L(x, y): x loves y All bees love all flowers which one of these answer choices a. (∀x)(B(x) → [(∃y)(F(y) ∧ L(x, y)] b. (∀x)(B(x) → [(∀y)(F(y) ∧ L(x, y)] c. (∀x)(B(x) → [(∀y)(F(y) → L(x, y)] d. (∀x)(B(x) ∧ [(∃y)(F(y) → L(x, y)]arrow_forward1. Use resolution to determine if the following arguments are valid. Use the predicates suggested.arrow_forward
- The teams is a sports competition are divided into six groups with five teams in each group. Each team plays the other teams in its group once only. Write a Prolog preciate schedule(S) that is true if S is a valid schedule. A schedule lists the fixtures for each day of the competition. In a fixture (A,B), team A is the home team and team B is the away team. A schedule is valid if: • there are no more than three matches on any day, • each team has the same number of home and away fixtures in the whole schedule, and • each team has at least four rest days between fixtures. Ideally the schedule S should be as short as possible, and the predicate schedule should be able to generate multiple valid schedules.arrow_forwardDefine the following predicates: • A(x) : x is on the board of directors." • E(x) : x earns more than $100, 000. • W(x) : x works more than 60 hours per week. The domain is the set of all employees of a certain company. Match each English statement with its equivalent logical expression. ? v 1. Everyone who works more than 60 hours per week earns more than $100,000. A. 3x(E(x) ^ ¬W(x)) B. Vx(W(x) → E(x)) C. Ex(¬A(x) → E(x)) D. Vx(W(x) ^ E(x)) E. 3x(¬A(x) ^ E(x)) F. 3x(A(x) ^ ¬E(x)^ W(x)) G. Ex(A(x) V ¬E(x) V W(x)) H. Vx(A(x) → E(x)) I. Vx(A(x) ^ E(x)) 2 v 2. Someone on the board of directors does not earn more that $100.000 and works more than 60 hours per week. ? v 3. Every member of the board of directors earns more than $100,000. 2. v 4. There is someone who is not on the board of directors and earns more than $100,000. ? v 5. There is someone who earns more than $100,000, but does not work more than 60 hours per week.arrow_forwardExhibit the structure of the following statements by transforming them into a first-order formula,indicating the interpretation of predicates and the domain. For example the statement There isno greatest integer can be transformed into ¬∃x, ∀y, P(x, y) where P(x, y) is the predicate x ≥ y,the domain being the integers.Do not try to prove them (it may not be possible!).1. Every integer can be written as the sum of 2 squares.2. Every positive real number has a square root.3. The cosine function has zeroes.4. The cosine function has at least two distinct zeroes.5. There is a neutral element1for multiplication in real numbers.6. Every odd square can be written as the sum of three odd numbers.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education