Computers and Technology, 09.07.2021 01:30 Shayleechase

Family Given are some facts in the following form.

male(jack).
male(oliver).
male(ali).
male(james).
male(simon).
male(harry).
female(helen).
female(sophie).
female(jess).
female(lily).
parent(jack, jess).
parent(jack, lily).
parent(helen, jess).
parent(helen, lily).
parent(oliver, james).
parent(sophie, james).
parent(jess, simon).
parent(ali, simon).
parent(lily, harry).
parent(james, harry).

where male/1 and female/1 state the gender of a person, and parent/2 means that the first argument is a parent of the second (in this case Jack is a parent of Jess).

Write the following predicates:
• mother/2
• father/2
• grandmother/2
• grandfather/2
• ancestor/2

Example execution:

?- father(ali, X)
X = simon

?- grandfather(jack, X).
X = simon
X = harry

?- ancestor(X, Y).
X = jack, Y = jess
X = jack, Y = lily
X = helen, Y = jess
…

Answers: 3

Show answers

Another question on Computers and Technology

Computers and Technology, 23.06.2019 17:00

*! 20 points! *jeff wants to create a website with interactive and dynamic content. which programming language will he use? a. dhtml b. html c. css d. javascript

Answers: 1

Answer

Computers and Technology, 24.06.2019 15:30

The idea that, for each pair of devices v and w, there’s a strict dichotomy between being “in range” or “out of range” is a simplified abstraction. more accurately, there’s a power decay function f (·) that specifies, for a pair of devices at distance δ, the signal strength f(δ) that they’ll be able to achieve on their wireless connection. (we’ll assume that f (δ) decreases with increasing δ.) we might want to build this into our notion of back-up sets as follows: among the k devices in the back-up set of v, there should be at least one that can be reached with very high signal strength, at least one other that can be reached with moderately high signal strength, and so forth. more concretely, we have values p1 ≥ p2 ≥ . . ≥ pk, so that if the back-up set for v consists of devices at distances d1≤d2≤≤dk,thenweshouldhavef(dj)≥pj foreachj. give an algorithm that determines whether it is possible to choose a back-up set for each device subject to this more detailed condition, still requiring that no device should appear in the back-up set of more than b other devices. again, the algorithm should output the back-up sets themselves, provided they can be found.\

Answers: 2

Answer

Computers and Technology, 24.06.2019 16:50

How many types of string types does python support?

Answers: 1

Answer

Computers and Technology, 25.06.2019 05:10

What is the output of the following program? #include using namespace std; class bclass { public: void print() const; bclass(int a = 0, int b = 0); //postcondition: x = a; y = b; private: int x; int y; }; class dclass: public bclass { public: void print() const; dclass(int a = 0, int b = 0, int c = 0); //postcondition: x = a; y = b; z = c; private: int z; }; int main() { bclass bobject(2, 3); dclass dobject(3, 5, 8); bobject.print(); cout < < endl; dobject.print(); cout < < endl; return 0 ; } void bclass: : print() const { cout < < x < < " " < < y < < endl; } bclass: : bclass(int a, int b) { x = a; y = b; } void dclass: : print() const { bclass: print(); cout < < " " < < z < < endl; } dclass: : dclass(int a, int b, int c) : bclass(a, b) { z = c; }

Answers: 3

Answer

You know the right answer?

Family Given are some facts in the following form.

male(jack).
male(oliver).

Questions