Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

1) For each of the following pairs of expressions find a most general unifier, or explain why a unifier cannot be found. . f(x, b,

image text in transcribed

1) For each of the following pairs of expressions find a most general unifier, or explain why a unifier cannot be found. . f(x, b, g(b) ) and f(a, Z, Y) . f (x, b, g(b)) and f(a, b, Y) . f(a, X, g(y, Y) ) and f(Y, b, Z) .E(x, Y, g(Z)) and (X, g(h (Z)), Y) [F, [A, 1, B], [A, B], 2] and [C, [D, D, E], C, E] 2) Use the semantic approach to check the following possible entailments Show your work. 1) For each of the following pairs of expressions find a most general unifier, or explain why a unifier cannot be found. . f(x, b, g(b) ) and f(a, Z, Y) . f (x, b, g(b)) and f(a, b, Y) . f(a, X, g(y, Y) ) and f(Y, b, Z) .E(x, Y, g(Z)) and (X, g(h (Z)), Y) [F, [A, 1, B], [A, B], 2] and [C, [D, D, E], C, E] 2) Use the semantic approach to check the following possible entailments Show your work

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Principles Of Database Systems With Internet And Java Applications

Authors: Greg Riccardi

1st Edition

020161247X, 978-0201612479

More Books

Students also viewed these Databases questions