A database of Prolog facts for a group of people contains the following two types of facts: male([, , .. ] ). emale([, , ... ] ). ge( , ) E.g., male([alex, tom, vic, ..]). E.g., female([ann, sara, ella, ..]). E.g. age(ann, 66). For these facts write the following rules (you may use Prolog library functions): person(, ). gender(, gender>). oldest(, , ). neanAgeM(). count(, , ). Find the name and the age of a person Find the name and the gender (male or female) Find the name/age/gender of the oldest person Find the mean age of male people Find the number of male, female, and total people

A database of Prolog facts for a group of people contains the following two types of facts: male([, , .. ] ). emale([, , ... ] ). ge( , ) E.g., male([alex, tom, vic, ..]). E.g., female([ann, sara, ella, ..]). E.g. age(ann, 66). For these facts write the following rules (you may use Prolog library functions): person(, ). gender(, gender>). oldest(, , ). neanAgeM(). count(, , ). Find the name and the age of a person Find the name and the gender (male or female) Find the name/age/gender of the oldest person Find the mean age of male people Find the number of male, female, and total people

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

Discrete structures
Describe the concept of the abstract syntax tree (AST), and solve the following statement: for(a=10 ; a < 100 ; a+5) Print a;
Q3: Design a minimized CFG grammar then write a Visual Prolog program that describes commands related to moving a car. The grammar should accept queries of these forms: 1- "move", followed by a direction (up, down, right, or left), optionally followed by an adverb describing speed (quickly, rapidly, or slowly). 2- "enter", followed by the, followed by a noun (park or garage). 3- "exit", followed by the, followed by a noun (park or garage).
2- Write a prolog program to take a nested list and return the number of elements in the list. For instance ?- elements ([b, [a, [d, c], e]], X). X = 5 Please also show tracing model for the above example
Formal language
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.
6
What does Prolog return for the following querie : ?- [first,second,third] = [A|B] %3D
True or False, please have some explanation 1. A derivation is a way of showing that a specific grammar produces a specific string.
Question 6 sm .Please complete termTimesPolynomial/3, multiplyPolynomials/3 in prolog: % termTimesPolynomial(++Term, ++Poly, -Product). function. termTimesPolynomial(_Term, [], ...) :- !. termTimesPolynomial(Term, [Term1|Rest], ...) :- multiplyTerms(..., ..., ...), termTimesPolynomial(..., ..., ...), addPolynomials([...], ..., ...). % multiplyPolynomials(++Poly1, ++Poly2, -Product) function. multiplyPolynomials([], _Poly, ...). multiplyPolynomials([Term|Rest], Poly, ...) :- termTimesPolynomial(..., ..., ...), multiplyPolynomials(..., ..., ...), addPolynomials(..., ..., ...). /* Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line