The grandparent relation can be defined by rule the following way: For all X and Y,...

Question

Question

The grandparent relation can be defined by rule the following way:

For all X and Y,

X is the grandparent of Y if

X is a parent of Z and

Z is a parent of Y

Write the above relation in prolog

engineering Computer-Science

Answer 1

Answer #1

In prolog the relation will be as follows:

grandparent(X,Y):-

parent(X,Z),

parent(Z,Y).

Explanation:-

, Represents the and.

In prolog the statement "Ram is brother of sham" written as

brother (Ram,sham). Here brother is the relation and ram and sham is the Arguments.

Answer 2

Similar Homework Help Questions

QUESTION 1 Given the following relationships in Prolog clauses: father(X,Y) /* X is the father of...

QUESTION 1 Given the following relationships in Prolog clauses: father(X,Y) /* X is the father of Y */ mother(X,Y) /* X is the mother of Y */ male(X) /* X is male */ female(X) /* X is female */ parent(X,Y) /* X is a parent of Y */ diff(X,Y) /* X and Y are different */ Write Prolog clauses to define rules for the following relationships: is_mother(X) /* X is a mother */ is_father(X) /* X is a father */...
Suppose R is the relation defined on all real numbers by for all real numbers x,y...

Suppose R is the relation defined on all real numbers by for all real numbers x,y (xRy if |x-yl3) Then for real numbers x and y, xR2y iff
The Russian Multiplication problem can be defined as follows: Say you want to multiply x with...

The Russian Multiplication problem can be defined as follows: Say you want to multiply x with y giving z. The problem is solved using the following iterative loop: With each iteration, x gets the value x/2 and y gets the value y*2. If x is even, the y-entry is ignored. If x is odd, y is added to a running total. The loop terminates when x = 0. For example: Calculate z = 24 * 52. Write a Prolog program...

Let T be the relation defined on R given by T = {(x,y)|X, Y E RAx-yeZ}....

Let T be the relation defined on R given by T = {(x,y)|X, Y E RAx-yeZ}. a. Prove T is an equivalence relation. b. Prove Ō =Z c. Find 1.5
Show the following rule for MVD's. The attributes are arbitrary sets X, Y, Z and the...

Show the following rule for MVD's. The attributes are arbitrary sets X, Y, Z and the other unnamed attributes of the relation in which these dependencies hold. The Difference Rule. If X? Y, and Z are sets of attributes, X - > - > Y, and X - > - > Z, then X - > - > (Y-Z).
4. Say that Ris a preference relation defined on X and that R is complete and...

4. Say that Ris a preference relation defined on X and that R is complete and transitive. Show that for all r, y E X, if xPy, then for any z E X, either xPz or zPy or both.

For the relation R = { ( x , y ) ∣ x ≤ y }...

For the relation R = { ( x , y ) ∣ x ≤ y } defined on N (natural numbers), R-1 is Group of answer choices R^−1={(x,y)∣y>x} R^−1={(x,y)∣y≤x} R^−1={(x,y)∣y≥x} R^−1={(x,y)∣x>y} None of the above
Let X, be the set {x € Z|3 SXS 9} and relation M on Xz defined...

Let X, be the set {x € Z|3 SXS 9} and relation M on Xz defined by: xMy – 31(x - y). (Note: Unless you are explaining “Why not,” explanations are not required.) a. Draw the directed graph of M. b. Is M reflexive? If not, why not? C. Is M symmetric? If not, why not? d. Is M antisymmetric? If not, why not? e. Is M transitive? If not, why not? f. Is M an equivalence relation, partial order...
Cramer's Rule: 5. Use Cramer's Rule to find x,y and z for the following system of...

Cramer's Rule: 5. Use Cramer's Rule to find x,y and z for the following system of equations. X 2 7x + 2y - z= -1 ។ 6x + 5y + z = 16 -5x - 4y + 3z = -5 2 : 2 a. Write the coefficient matrix first for the system above. Call it matrix D. 7 2 5 L-8-4 3 1 14 ] = 0 b. Find the determinant of the coefficient matrix (det(D)).

10. [4] Let R be the relation on the set {0, {f}, {y}, {x,y}} defined by...

10. [4] Let R be the relation on the set {0, {f}, {y}, {x,y}} defined by R= {(S, T): SUT|=2} (a) Represent the relation R as a set of ordered pairs. (b) Represent the relation R as a relational digraph.