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
icon
Related questions
Question

find the results of the query in each case.

?eat(X, grass)

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
Transcribed Image Text: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
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Single Table
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education