Suppose that a Prolog database contains the following entries: eat(bear, fish) eat(fish, littlefish) eat(littlefish, algae) eat(raccoon, fish) eat(bear, raccoon) eat(bear, fox) eat(fox, rabbit) eat(rabbit, grass) eat(bear, deer) eat(deer, grass) eat(wildcat, deer) animal(bear) animal(fish) animal(littlefish) animal(raccoon) animal(fox) animal(rabbit) animal(deer) animal(wildcat) plant(grass) plant(algae) prey(X) <= eat(Y, X) and animal(X) Then the following dialog with Prolog could take place: ?animal(rabbit) yes ?eat(wildcat, grass) no ?eat(X, fish) bear гасcoon гасcoon ?eat(X, Y) and plant(Y) littlefish fox algae rabbit rabbit grass deer deer grass deer ?prey(X) Note that fish is listed twice as satisfying the last query because fish are eaten by bear (fact 1) and by raccoon (fact 3). Similarly, deer are eaten by both bear and wildcat. fish littlefish fish

Suppose that a Prolog database contains the following entries: eat(bear, fish) eat(fish, littlefish) eat(littlefish, algae) eat(raccoon, fish) eat(bear, raccoon) eat(bear, fox) eat(fox, rabbit) eat(rabbit, grass) eat(bear, deer) eat(deer, grass) eat(wildcat, deer) animal(bear) animal(fish) animal(littlefish) animal(raccoon) animal(fox) animal(rabbit) animal(deer) animal(wildcat) plant(grass) plant(algae) prey(X) <= eat(Y, X) and animal(X) Then the following dialog with Prolog could take place: ?animal(rabbit) yes ?eat(wildcat, grass) no ?eat(X, fish) bear гасcoon гасcoon ?eat(X, Y) and plant(Y) littlefish fox algae rabbit rabbit grass deer deer grass deer ?prey(X) Note that fish is listed twice as satisfying the last query because fish are eaten by bear (fact 1) and by raccoon (fact 3). Similarly, deer are eaten by both bear and wildcat. fish littlefish fish

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

Suppose a Prolog database exists that gives information about a family. Predicates of male, female, and parentof are included.a. Formulate a rule to define fatherof.b. Formulate a rule to define daughterof.c. Formulate a recursive rule to define ancestorof.
Write a Prolog Program that shows relationships in a list and show example of each with explanation. Male(x) Female(x) Father, mother, parent Sibling1, sibling2 Brother1, brother2 Sister1, sister2 Cousins Uncle, aunt Grandchild. Grandson, granddaughter Great-grand-parent Ancestor
Can someone use these prolog facts to complete the following rules? eat(bear, fish). eat(squirrel, nuts). eat(swan, seaweed). eat(bear, seaweed). eat(cat, fish). animal(fish). plant(seaweed). plant (nuts). Create three rules: herbivore(X) :- ? carnivore(X) :- ? omnivore(X) :- ?
Question 1 Convert the following information into a Prolog program 1.1 Monika owns a Basset named Lara 1.2 Waldo owns a Beagle named Oscar 1.3 Sjanie owns a Labrador named Zappa 1.4 Peter owns a Dalmation named Uzo 1.5 John owns a Boxer named Daisy 1.6 André owns a Labrador named Olga 1.7 Beagles are medium dogs and are used for hunting 1.8 Bassets are also used for hunting 1.9 Labradors are used as guide dogs
Write a PROLOG program that implements Zebra Puzzle Your program should implement the following facts for your answer. 1.There are five houses. 2.The Englishman lives in the red house. 3.The Spaniard owns the dog. 4.Coffee is drunk in the green house. 5.The Ukrainian drinks tea. 6.The green house is immediately to the right of the ivory house. 7.The Old Gold smoker owns snails. 8.Kools are smoked in the yellow house. 9.Milk is drunk in the middle house. 10.The Norwegian lives in the first house. 11.The man who smokes Chesterfields lives in the house next to the man with the fox. 12.Kools are smoked in the house next to the house where the horse is kept. 13.The Lucky Strike smoker drinks orange juice. 14.The Japanese smokes Parliaments. 15.The Norwegian lives next to the blue house.
Write a Prolog program to print all Pythagorean triples (x, y, z) such that 1 ≤ x , y ≤ z ≤ 100. ((x, y, z) is a Pythagorean triple if x * x + y * y = z * z.)
Computer Science _______ allow Prolog to infer new facts. Group of answer choices a) Facts b) Rules c) Queries d) Unification 2) A Prolog program retrieves information from a database by __________. Group of answer choices a) stating facts b) making rules c) posing queries d) unification
Encode the following knowledge as Prolog rules and facts. • Alice has an A in class • Brian has an B in class • Carrie has an C in class • David has an A in class • Erica has an B in class • Frank has an C in class • Gina has an B in class • With an A or a B, a student has a good grade • With an A, a student has a great grade Write a query that asks “Who is a good student?”.
Suppose a Prolog database exists that gives information about the parts in an automobile engine. Predicates of big, small, and partof are included.a. Write a query to find all small items that are part of other items.b. Write a query to find all big items that have small subitems.c. Formulate a recursive rule to define componentof.
Write the following questions in Prolog: 1. Who is the husband of Diana? 2. Who is/are the child/ren of Diana and Charles? 3. Who is/are the brother/s of William? 4. Who are the brothers of Anne? 5. Who is the mother of William? 6. Is Diana the mother of Anne? 7. Who are the parents of henry? 8. Do Andrew and Diana share the same mother? 9. Is Anne the wife of EdwardW? 10. List of all married couples.
The query?animal(bear)merely asks if the fact animal(bear) is in the database. Because this fact is in the database, Prolog would respond to the query by answering yes. (This is a one-step proof sequence—no rules of inference are required). Further dialogue with Prolog could include?eat(deer, grass)yes?eat(bear, rabbit)no
What does Prolog return for the followingquerie:?-[a.B].C]=[[A.b].[c.d]]