CSC 4640: Project 7

Project 7:
[ Prolog | OtherLangs ]

Assigned: Fri Mar 14 2025
Due: 11:59:00 PM on Fri Mar 21 2025
Team Size: 1
Language: SWI-Prolog
Out of: 100 points

In this project, you'll write procedures that create and use lists.

Part 0, 0 points: Look at the submission instructions below to set up your folder and source code file name.

Part 1, 1 points:

Write the recursive procedure has_monkey(List) that succeeds when List contains the string "monkey":

?- has_monkey(["apricorn", "monkey", "zebra"]).
true
?- has_monkey(["bird", "cheetah"]).
false

Part 2, 1 points:

Write the recursive procedure all_positive(Numbers) that succeeds when Numbers consists of only positive numbers:

?- all_positive([1, 2, 3, 4, 5]).
true
?- all_positive([100, -3, 55]).
false

Part 3, 10 points:

Write the recursive procedure ones_list(N, List) that creates a list of all ones of length N:

?- ones_list(5, List).
List = [1, 1, 1, 1, 1].

Part 4, 10 points:

Write the recursive procedure super_even(Numbers) that succeeds when Numbers consists of only even numbers and the length of the list is even:

?- super_even([2, 4, 6, 8]).
true
?- super_even([0, 0, 0]).
false
?- super_even([1, 2, 3, 4]).
false

There is a sneaky trick to write this one without length/2 or fail. My solution used only five lines.

Part 5, 10 points:

Write the recursive procedure sum_evens(Numbers, Sum) that unifies Sum with the sum of all even numbers in list Numbers:

?- sum_evens([2, 4, 6, 8], X).
X = 20
?- sum_evens([1, 2, 3, 5, 6], X).
X = 8

Part 6, 10 points:

Check out reverse/2, then write the procedure swap_ends(List, EndsSwapped) that unifies EndsSwapped to be the same as List, but with the first and last elements swapped:

?- swap_ends([2, 4, 6, 8], X).
X = [8, 4, 6, 2].
?- swap_ends([1, 2, 3, 4, 5, 6], X).
X = [6, 2, 3, 4, 5, 1].

I did not explicitly use recursion in my solution.

Part 7, 10 points:

Write the recursive procedure longest(Strings, LongestString) that unifies LongestString to be the longest string in Strings:

?- longest(["Hi", "Baby"], X).
X = "Baby".
?- longest(["Hi", "Baby", "Yo"], X).
X = "Baby".

Part 8, 20 points:

Write the recursive procedure add_five_to_all(Numbers, NumbersPlusFive) that unifies NumbersPlusFive to be the same list as Numbers, except that each element is 5 larger:

?- add_five_to_all([1, 2, 3], X).
X = [6, 7, 8].

Part 9, 10 points:

Write the procedure multiples_only(Base, Numbers, Multiples) that unifies Multiples to be the same list as Numbers, except only those elements that are multiples of Base:

?- multiples_only(3, [1, 2, 3], X).
X = [3].
?- multiples_only(12, [0, 5, 10, 11, 12, 20, 24, 25, 30, 35, 36], X).
X = [0, 12, 24, 36].

Part 10, 10 points:

Write the procedure sums(NumbersLists, Sums), where NumbersLists is a list of lists of numbers. The procedure unifies Sums to be the list of sums of each of the elements of NumbersLists:

?- sums([[1, 2], [3, 4], [5, 6]], X).
X = [3, 7, 11].
?- sums([[1, 2], [3, 4, 5, 6], [5, 6], [1]], X).
X = [3, 18, 11, 1].

Hint: there's a built in procedure that makes this really easy.

Part 11, 5 points:

Update ones_list/2 so that it works in both directions.

Part 12, 3 points:

Update add_five_to_all/2 so that it works in both directions. Go even further and make this so robust that it be used when the variable entries are woven throughout the lists:

?- add_five_to_all([1, X, 3], [Y, 7, Z]).
X = 2, Y = 6, Z = 8.

My solution used only two rules.

Submitting your Project: Put all your procedure definitions in one file named project7.pl in a folder named <TeamName>Project7 where <TeamName> has all team members' (last) names separated by 'and' in PascalCase. For example, if I had worked with Alyssa Borgin, my folder name would be: BorginAndBurkeProject7. The code file should be located directly in that folder. Zip the folder up (don't change the file name) and upload the zip file to the assignment in Canvas.