Computer Science Homework Help

Prolog program: draw derivation trees

/* Consider the following Prolog program: */

member(X,[X|Xs]).

member(X,[Y|Xs]) :- member(X,Xs).

disjoint([],Ys).

disjoint([X|Xs], Ys) :- not(member(X, Ys)), disjoint(Xs,Ys).

Draw the derivation trees for the following queries:

(a) ?- disjoint([1,2,3],[4,2]).

(b) ?- disjoint([1,2,3],Xs).

As a short reminder:

+ Goal

is the same as

not(Goal)

Solution:

Information about customers is confidential and never disclosed to third parties.

No missed deadlines – 97% of assignments are completed in time.

We complete all papers from scratch. You can get a plagiarism report.

If you are convinced that our writer has not followed your requirements, feel free to ask for a refund.