Need merge predicate

Thread View: comp.lang.prolog

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Allen M. Theobald Sat, 31 Oct 1992 16:32

#31

Author: Allen M. Theobald
Date: Sat, 31 Oct 1992 16:32

20 lines
942 bytes

For all you guru prolog programmers out there...

I need help defining a predicate merge1(L1,L2,L3) that is true
whenever L3 can be obtained by merging the lists L1 and L2 such
that there are no duplicates in L3 and all those members of L1 
that are not in L2 appear in L3 before all the other members of
L3.

To put it another way L3 = L1 conc L2 such that there are no duplicates
in L3.

Most of the merge predicates defined do not remove duplicates!

Any solutions and/or advice welcome...

Thanks in advance!  Please mail responses directly to me.



				Allen

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads