Consider the following list of sentences about members of the set Pof all pets. 1. If any pet is not a black cat, then that pet has a tail. 2. If some pet has a tail, then that pet is a black cat. 3. At least one pet is a black cat. 4. Every pet which is a black cat has a tail. 5. Every pet which has a tail is a black cat. 6. If a pet is a black cat, then that pet does not have a tall. 7. Every pet which is a black cat does not have a tail. 8. At least one pet is a black cat and has a tail. Let b (x) be the predicate x is a block cat and let t (2) be the predicate x has o toil. 1) Væ € P, b (x) → t (2) 2) Væ e P, t (x) → b (z2) 3) 3a e P|6 (2) A t (x) 4) Væ € P, -b (x) → t (2) 5) Væ € P, b (w) → t (æ) 6) 3a € P|b (x)

Consider the following list of sentences about members of the set Pof all pets. 1. If any pet is not a black cat, then that pet has a tail. 2. If some pet has a tail, then that pet is a black cat. 3. At least one pet is a black cat. 4. Every pet which is a black cat has a tail. 5. Every pet which has a tail is a black cat. 6. If a pet is a black cat, then that pet does not have a tall. 7. Every pet which is a black cat does not have a tail. 8. At least one pet is a black cat and has a tail. Let b (x) be the predicate x is a block cat and let t (2) be the predicate x has o toil. 1) Væ € P, b (x) → t (2) 2) Væ e P, t (x) → b (z2) 3) 3a e P|6 (2) A t (x) 4) Væ € P, -b (x) → t (2) 5) Væ € P, b (w) → t (æ) 6) 3a € P|b (x)

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

agents: An agent is trying to eat all the food in a maze that contains obstacles, but he now has the help of his friends! An agent cannot occupy a square that has an obstacle. There are initially k pieces of food (represented by dots), at positions (f1,...,fk). There are also n agents at positions (p1,...,pn). Initially, all agents start at random locations in the maze. Consider a search problem in which all agents move simultaneously ;that is, in each step each agent moves into some adjacent position (N, S, E, or W, or STOP). Note that any number of agents may occupy the same position. Figure 1: A maze with 3 agents For each of the following heuristics, indicate (yes/no) whether or not it is h1: The number of dots (representing food) remaining. [ True, False ]. h2(s)=0, where s is a state node. [ True, False ]. h3(s)=1, where s is a state node. [ True, False ].
A Locker can be opened by A and B when they are both there, as the locker has two keys, one of which is with A and other with B. C has both the keys, but he is permitted to open the locker only when B is not there. show that locker can be opened always if both A and C are there. Give boolean identify that symbolises this situation.
Select ALL the sentences of FOL. G(P) AxLikes(x,pia) G(p) Pia AxLikes(x,y) AxGuilty(x) Guilty(x)
Members of Set A = {Monday, Tuesday, Wednesday, Friday, Saturday, Sunday} What is the cardinality of St A ?
Conway's Game of Life: This is a zero person game with the following rules: (see Wikipedia for example) Any live cell with fewer than two live neighbours dies, as if by underpopulation. Any live cell with two or three live neighbours lives on to the next generation. Any live cell with more than three live neighbours dies, as if by overpopulation. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction. Remember the oscillator or blinker of 3 cells. You can also find this blinker on Wikipedia. 1 21 1 2 1 21 3. 4 6 4. 6. 4 8. 9 8 9 #1 #2. #3 5. Consider now these 3 creatures at stage 1: Show how they look like in the next two stages: stage 2 and stage 3. Explain how you get the answers Creature 1 Creature 2 Creature 3 (here creature 1 is the blinker of 3 cells, horizontally; creature 2 consists of two adjacent cells, creature 3 consists of 4 adjacent cells horiztonally) ww (d) Creature 1 (10%), (e) Creature 2 (8%), (f) Creature 3 (20%)
Consider a game that you want to develop to impress your friend. You design a game with rules: “A player rolls a die and a coin in a single throw. Each die has six faces. These faces contain 1, 2, 3, 4, 5, and 6 spots. A coin has two faces, e.g., Head and Tail (Head is considered as 1 and Tail as 0). After the die and coin have come to rest, the sum of the upward spots of die and coin is calculated. If the sum is 7 (makes 6 for the die and Head for coin) the player wins, if the sum is 1 (makes 1 for the die and Tail for coin) the player loses. The remaining point becomes the player's “point”. To win the game, the player must continue rolling the die and coin until the player makes his "point". The player loses by getting 7 or 1 before making his point.” Write down a Java program that simulates this game.
2. Consider the following information: - Animals can outrun any animals that they can eat. Carnivores eat other animals. - Outrunning is transitive: if x can outrun y and y can outrun z, then x can outrun z. Lions eat zebras. Zebras can outrun dogs. Dogs are carnivores. Using this a. Write a set of FOL sentences representing the information using the standard notation for FOL. b. Convert these sentences to clausal normal form. c. Use resolution theorem proving to find three animals that lions can outrun, showing the result as a proof graph.
Comp science
link(a,b). link(a,c). link(b,c). link(b,d). link(c,d). link(d,e). link(d,f). link(e,f). link(f,g). Using the above Formulate the appropriate Prolog predicate "path(X,Y,N)" which is true if (and only if) there is a path of length "N" from node "X" to node "Y". For example, there is a path of length