Prolog Tutorial

 
 
 

Prolog Basics

Read number Parent Tree Search company, car name, price, class, color Relation translate L1, L2 to num b/w 0 and 9 Read file and create list of all the lines of it Add and multiply numbers Find grade Concate , member in list, reverse, delete list Reverse list using concatenate Check number is member of given list or not 10 int in list,10 from database - find 2nd max

Search Programs

Game LT Relation dividelist (L,L1,L2) Find factorial of given number Create window i/p string, remove the window & text Display item name, code, quantity, price,grade Find easy courses person likes Logic repres - converting to prove the proof Define relation shift L1,L2- L1 shift by one left Read file display line by line - go to output file Find grade Find relations Insert an element anywhere in the list Check given word is a palindrome or not Delete an element from given list Copy String length equal to number using file Sort list of integers using Insertion Sort Delete an element from list using concatenate Read 10 strings into a list & display similar char Parent and predecessor Generate first 10 prime num store them in list Blocks problem using hill climbing Find last item of the list Check whether given list is palindrome or not Store cricket players details in database Find maximum number from inputted number Monkey and banana Find nth element of a list Merge two ordered list Print number from 1 to 25 Murder mystery 8puzzle - heuristic function % - best first search Relation last(item,list) so last el w/o concate Ask question Buy and sale cars Print zodiac sign of a given birth date Use of list DB Employees - Print emp children of given age

Problem Solving

Game 5*5 matrix -moving in spiral way- dice value Fibonacci Series Read two strings concatenation of the both Production system - Missionary cannibal problem Add element in head position in given list Water Jug Problem start with state(0,0) end (2,0) Search record by name and phone number Add an element to the begining of list Print message Find relations in family Login page Relation split(L,P,N) Find sum of all numbers in given list Show no of user entered book - 2 diff database

Sort Programs

Game EX Find length of a list is even or odd String token Generate facts of family - take different relation Compare character and string Medical Diagnostic system Rotate list n places to the left Define relation shift L1,L2- L1 shift by one right Read sentence from file copy each of token in list Program to print user entered number Marcus Check year is a leap year or not Find permutation of a given list Find last element in a given list Read file and create a list of all words of it

Basic Programs

Sort list using Bubble Sort Delete el from given list w/o using concatenate Display strings with closest length of int entered Find murderer Compare characters, strings, reverse string 4-3 Gallon Water Jug Problem Split list in negative & positive list Reverse given list Read and write file Find length of names Teacher and lecture Generate sublist of a given list Write elements of the list line by line Concatenate two lists in giving third list Copy in database - string length equal to number Sort list using Quick Sort Relation count(A,L,N) num of occurrences Find summation of list of numbers Buy car and truck Family hierarchy Person hobbies Predicate order (List) is true if List is ordered String in increasing order of their length in db

File and Database Programs

Spiral game Relation max(X,Y,Max) Display each digit with respective frequencie Add element in last position in given list Predicate logic representation and prove proof Search student data - Name or phone no is i/p Rel last(item,list) so item is last el of list Convert decimal number to roman number Find animals leaving in water and land Defines predicate maxlist (L,Max) Find names of student obtained marks greater Find length of given list DB of teacher - show no of lectures require

Game

Game Predicates evenlength(List) and oddlength(List) Multi-List Program Run marriage burro
 

Prolog program for solving the blocks problem using hill climbing

 
/******************************************************************************
Write a prolog program for solving the blocks problem using hill climbing 
*******************************************************************************/
%trace
domains
    heuristic_val = integer    
    top_type = top(integer)
    node_type = on(integer,integer)

    nodetype_list = node_type*
    top_list = top_type*
    file = xoutput    
database
    curr_db_list(nodetype_list,top_list,heuristic_val)
    child_db_list(nodetype_list,top_list,heuristic_val)
    best_child(nodetype_list,top_list,heuristic_val)

    db_on(integer,integer)
    db_top(integer)

    heuristic_value_db(integer)
    temp_nodelist(nodetype_list)
    temp_toplist(top_list)


predicates
    block(integer)
    initial_state
    retract_all_db
    write_list
    writelist(nodetype_list)

    get_heuristic_value(integer)
    compute_heuristic

    create_node_top_list(nodetype_list,top_list)
    create_node_list
    create_top_list
    append_node(nodetype_list,nodetype_list,nodetype_list)
    append_top(top_list,top_list,top_list)

    find_children(nodetype_list,top_list,integer)
    find_path
    find_best_child
    move_block(integer,nodetype_list,top_list)

    copy_on_top_to_db(nodetype_list,top_list)
    copy_on_to_db(nodetype_list)
    copy_top_to_db(top_list)

    delete_curr_best_db
clauses

    write_list:-
        curr_db_list(NodeList,TopList,HVal),
        writelist(NodeList),
        nl,
        nl,
        fail.

    writelist([]):- nl.
    writelist([Head|Tail]):-
        write(Head),
        writelist(Tail).

    retract_all_db:-
            retractall(curr_db_list(_,_,_)),
            retractall(db_on(_,_)),
            retractall(db_top(_)),
            retractall(heuristic_value_db(_)),
            retractall(temp_nodelist(_)),
            retractall(temp_toplist(_)),
            retractall(child_db_list(_,_,_)),
            retractall(best_child(_,_,_)).

    block(1).
    block(2).
    block(3).
    block(4).
    block(5).
    block(6).
    block(7).
    block(8).
    block(0).

    initial_state:- 
            assert(db_on(1,8)),
            assert(db_on(8,7)),
            assert(db_on(7,6)),
            assert(db_on(6,5)),
            assert(db_on(5,4)),
            assert(db_on(4,3)),
            assert(db_on(3,2)),
            assert(db_on(2,0)),
            assert(db_top(1)),
            create_node_top_list(NodeList,TopList),
            get_heuristic_value(HeuristicVal),
            assert(curr_db_list(NodeList,TopList,HeuristicVal)),
            writelist(NodeList).

    delete_curr_best_db:-
        retractall(best_child(_,_,_)),
        assert(best_child([],[],-9999)),
        retract(curr_db_list(_,_,_)),
        !.    

    find_path:-
            curr_db_list(NodeList,TopList,HeuristicVal),
%            retract(curr_db_list(NodeList,TopList,HeuristicVal)),
            delete_curr_best_db,
            find_children(NodeList,TopList,HeuristicVal),
            find_best_child,
            best_child(BestNodeList,BestTopList,BestHVal),
            writelist(BestNodeList),
            BestHVal <> 8,
            assert(curr_db_list(BestNodeList,BestTopList,BestHVal)),
%            write(\"BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB\\n\"),
            find_path.


    find_path:-!.

    find_children(NodeList,TopList,HeuristicVal):-
            retractall(db_top(_)),
            retractall(db_on(_,_)),
            retractall(child_db_list(_,_,_)),
            copy_on_top_to_db(NodeList,TopList),
            db_top(X),
            move_block(X,NodeList,TopList),
            fail.

    find_children(NodeList,TopList,HeuristicVal):-!.

    find_best_child:-
            child_db_list(NodeList,TopList,HeuristicValue),
%            write(\"-----CHILD-----------\\n\"),
%            writelist(NodeList),
            best_child(A,B,BestValue),
            HeuristicValue >= BestValue,
            not(best_child(NodeList,TopList,HeuristicValue)),
            retract(best_child(A,B,BestValue)),
            assert(best_child(NodeList,TopList,HeuristicValue)),
            fail.

    find_best_child:-!.

    get_heuristic_value(X):-
        assert(heuristic_value_db(0)),
        compute_heuristic(),
        heuristic_value_db(X),
        retract(heuristic_value_db(X)).
%        write(X,\"\\n\").

    compute_heuristic:-
        block(Y),        
        db_on(Y,Z),
        Y = Z + 1, 
        heuristic_value_db(OLD_VAL),
        retract(heuristic_value_db(OLD_VAL)),
        NEW_VAL = OLD_VAL + 1,
        assert(heuristic_value_db(NEW_VAL)),
        fail.

    compute_heuristic:-
        block(Y),
        db_on(Y,Z),
        Y > Z + 1,
        heuristic_value_db(OLD_VAL),
        retract(heuristic_value_db(OLD_VAL)),
        NEW_VAL = OLD_VAL - 1,
        assert(heuristic_value_db(NEW_VAL)),
        fail.


    compute_heuristic:-
        block(Y),        
        db_on(Y,Z),
        Y < Z, 
        heuristic_value_db(OLD_VAL),
        retract(heuristic_value_db(OLD_VAL)),
        NEW_VAL = OLD_VAL - 1,
        assert(heuristic_value_db(NEW_VAL)),
        fail.

    compute_heuristic.


    move_block(X,OldNodeList,OldTopList):-
            block(Y),
            X <> Y,
            Y <> 0,
            retractall(db_on(_,_)),
            retractall(db_top(_)),
            copy_on_top_to_db(OldNodeList,OldTopList),
            db_top(Y),
            db_on(X,Z),
            Z <> 0,
            retract(db_on(X,Z)),
            retract(db_top(Y)),    
            assert(db_on(X,Y)),
            assert(db_top(Z)),
            get_heuristic_value(HeuristicValue),
            create_node_top_list(NodeList,TopList),
            not(child_db_list(NodeList,TopList,HeuristicValue)),
            assert(child_db_list(NodeList,TopList,HeuristicValue)),
%            write(\"MOVED--------------\\n\"),
%            writelist(NodeList),
            fail.

    move_block(X,OldNodeList,OldTopList):-
            block(Y),
            X <> Y,
            Y <> 0,
            retractall(db_on(_,_)),
            retractall(db_top(_)),
            copy_on_top_to_db(OldNodeList,OldTopList),
            db_top(Y),
            db_on(X,Z),
            Z = 0,
            retract(db_on(X,Z)),
            retract(db_top(Y)),    
            assert(db_on(X,Y)),
            get_heuristic_value(HeuristicValue),
            create_node_top_list(NodeList,TopList),
            not(child_db_list(NodeList,TopList,HeuristicValue)),
            assert(child_db_list(NodeList,TopList,HeuristicValue)),
%            write(\"MOVED--------------\\n\"),
%            writelist(NodeList),
            fail.

    move_block(X,OldNodeList,OldTopList):-
%            write(\"\\nEntering YYYY\"),
            block(Y),
            X <> Y,
            Y = 0,
            retractall(db_on(_,_)),
            retractall(db_top(_)),
            copy_on_top_to_db(OldNodeList,OldTopList),
            not(db_on(X,Y)),
            db_on(X,Z),
            Z <> 0,
            retract(db_on(X,Z)),
            assert(db_on(X,Y)),
            assert(db_top(Z)),
            get_heuristic_value(HeuristicValue),
            create_node_top_list(NodeList,TopList),
            not(child_db_list(NodeList,TopList,HeuristicValue)),
            assert(child_db_list(NodeList,TopList,HeuristicValue)),
%            write(\"MOVED--------------\\n\"),
%            writelist(NodeList),
            fail.

    move_block(X,OldNodeList,OldTopList).

    create_node_top_list(NodeList,TopList):-
            retractall(temp_nodelist(_)),
            retractall(temp_toplist(_)),
            assert(temp_nodelist([])),
            assert(temp_toplist([])),
            create_node_list,
            create_top_list,
            temp_nodelist(NodeList),
            temp_toplist(TopList),
            retractall(temp_nodelist(_)),
            retractall(temp_toplist(_)).

    create_top_list:-
            db_top(X),
            temp_toplist(TopList),
            retract(temp_toplist(TopList)),
            append_top([top(X)],TopList,TopList1),
            assert(temp_toplist(TopList1)),
            fail.

    create_top_list.

    create_node_list:-
            db_on(X,Y),
            temp_nodelist(NodeList),
            retract(temp_nodelist(NodeList)),
            append_node([on(X,Y)],NodeList,NodeList1),
            assert(temp_nodelist(NodeList1)),
            fail.

    create_node_list.

    append_node([],ListB,ListB).

    append_node([X|List1],List2,[X|List3]):-
            append_node(List1,List2,List3).

    append_top([],ListB,ListB).

    append_top([X|List1],List2,[X|List3]):-
            append_top(List1,List2,List3).

    copy_on_top_to_db(NodeList,TopList):-
        retractall(db_on(_,_)),
        retractall(db_top(_)),
        copy_on_to_db(NodeList),
        copy_top_to_db(TopList),
        !.

    copy_on_to_db([]).
    copy_on_to_db([on(X,Y)|Tail]):-
        assert(db_on(X,Y)),
        copy_on_to_db(Tail).

    copy_top_to_db([]).
    copy_top_to_db([top(X)|Tail]):-
        assert(db_top(X)),
        copy_top_to_db(Tail).
goal
    clearwindow,
    retract_all_db,
    openwrite(xoutput,\"hill.dat\"),
    writedevice(xoutput),
    initial_state,
    find_path,
    closefile(xoutput),
    writedevice(screen).


Output

on(2,0)on(3,2)on(4,3)on(5,4)on(6,5)on(7,6)on(8,7)on(1,8)
on(1,0)on(8,7)on(7,6)on(6,5)on(5,4)on(4,3)on(3,2)on(2,0)
on(8,0)on(2,0)on(3,2)on(4,3)on(5,4)on(6,5)on(7,6)on(1,0)
on(7,0)on(1,0)on(6,5)on(5,4)on(4,3)on(3,2)on(2,0)on(8,0)
on(6,0)on(8,0)on(2,0)on(3,2)on(4,3)on(5,4)on(1,0)on(7,0)
on(5,0)on(7,0)on(1,0)on(4,3)on(3,2)on(2,0)on(8,0)on(6,0)
on(4,0)on(6,0)on(8,0)on(2,0)on(3,2)on(1,0)on(7,0)on(5,0)
on(3,0)on(5,0)on(7,0)on(1,0)on(2,0)on(8,0)on(6,0)on(4,0)
on(2,1)on(4,0)on(6,0)on(8,0)on(1,0)on(7,0)on(5,0)on(3,0)
on(3,2)on(5,0)on(7,0)on(1,0)on(8,0)on(6,0)on(4,0)on(2,1)
on(4,3)on(2,1)on(6,0)on(8,0)on(1,0)on(7,0)on(5,0)on(3,2)
on(5,4)on(3,2)on(7,0)on(1,0)on(8,0)on(6,0)on(2,1)on(4,3)
on(6,5)on(4,3)on(2,1)on(8,0)on(1,0)on(7,0)on(3,2)on(5,4)
on(7,6)on(5,4)on(3,2)on(1,0)on(8,0)on(2,1)on(4,3)on(6,5)
on(8,7)on(6,5)on(4,3)on(2,1)on(1,0)on(3,2)on(5,4)on(7,6)

    Related Post:
  1. Program to find easy courses person likes
  2. Prolog program to reverse a list
  3. ProLog Program to find grade
  4. Prolog program to find the permutations of a given list i.e. to find all possible combinations of the elements of a list
  5. ProLog Program of Backtracking through fail
  6. Prolog program to store cricket players details in the database
  7. Game LT
  8. Program to compare character and string
  9. Prolog program to use of list
  10. Prolog program to read a list of strings , integer and display all the strings with the closest length of the integer entered should go to a new list
  11. Prolog program to reverse a list using concatenate
  12. Program to find the names of all the student who have obtained marks greater than equal to the Marks in the Subject specified at the goal prompt
  13. Prolog program of 8-puzzle using heuristic function % with best first search technique
  14. Prolog program to add an element in a last position in given list
  15. Prolog program to delete an element from a given list without using concatenate
  16. Prolog program of spiral game
  17. ProLog Program of marcus
  18. Prolog program to define the relation shift(L1,L2) so that L2 is L1 shifted rotationally by one element to the left
  19. Prolog program to check whether a given list is palindrome or not
  20. ProLog Program to read list of strings and numbers and copy in database having having string length equal to number using files
 
 
Didn't find what you were looking for? Find more on Prolog program for solving the blocks problem using hill climbing