Question: Write prolog recursive rule count3(L, P, Z, N), where. L is a list of integers, P is the number of positive numbers in L; Z

 Write prolog recursive rule count3(L, P, Z, N), where. L is

Write prolog recursive rule count3(L, P, Z, N), where. L is a list of integers, P is the number of positive numbers in L; Z is the number of zerod in L; N is the number of negative numbers in L; Test case: | ?- count3 ([1, 2, 3, 0, -2], X, Y, z). X = 3 Y = 1 Z = 1?; no | ?- Write prolog recursive rule count3(L, P, Z, N), where. L is a list of integers, P is the number of positive numbers in L; Z is the number of zerod in L; N is the number of negative numbers in L; Test case: | ?- count3 ([1, 2, 3, 0, -2], X, Y, z). X = 3 Y = 1 Z = 1?; no |

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!