AI Programs Using Prolog

AI Programs Using Prolog

1. Write a Prolog program to calculate sum of two number.

2. Write a Prolog program to find the maximum of two numbers.

3. Write a Prolog program to find factorial of a given number.

4. Write a Prolog program to generate fibonocci series.

5. Write a Prolog program,  to find gcd of two numbers.

6. Write a Prolog program to implement power(num,pow,Ans),where number raised to power pow to get Ans.

7. Write a Prolog program, to implement multi(N1,N2,R).

8. Write a Prolog program to implement tower to hanoi.

9.Write a Prolog program to implement cyclic directed graph.

10. Write a Prolog program to implement memb(X,L),to check whether X is a member of L.

11. Write a Prolog program to implement conc(L1,L2,L3),concatenate L1 to L2.

12. Write a Prolog program to implement reverse(L,R),Where L is list which we have to reverses.

13. Write a Prolog program to implement palindrome(L).

14. Write a Prolog program to implement sumlist(L,S),find sum of a list.

15. Write a Prolog program to implement two predicates evenlength(List) and oddlength(List) so that they are true if their argument is a list of even or odd length respectively.

16. Write a Prolog program, to implement nth_element(N,L,X) where N is the desired postion,L is the list and X represents the n elements of list .

17. Write a Prolog program to implement remove_dub(L,R),where L is the list and remove the duplicates from list and store it to R.

18.Write a Prolog program to implement maxlist(L,R),where max element is find using list.

19. Write a Prolog program to implement insert_nth(I,N,L,R),that inserts an item I into Nth position of list L to generate a list R.

20. Write a Prolog program to implement sublist(S, L) that checks whether the list S is the sublist of list L or not. (Check for sequence or the part in the same order).

21. Write a Prolog program to implement delete_nth (N, L, R) that removes the element on Nth position from a list L to generate a list R.

22. Write a Prolog program to implement delete_all (X, L, R) where X denotes the element whose all occurrences has to be deleted from list L to obtain list R.

23. Write a Prolog program to implement merge (L1, L2, L3) where L1 is first ordered list and L2 is second ordered list and L3 represents the merged list.

24. Write a PROLOG program that will take grammar rules in the following format: NT (NT | T)* Where NT is any nonterminal, T is any terminal and Kleene star (*) signifies any number of repetitions, and generate the corresponding top-down parser.