documentation

Author: rahul1947

LP05-Constraint-Logic-Programming-CLPFD/rsn170330_HW05_CS6374.pdf renamed to LP05-Constraint-Logic-Programming-CLPFD/CS6374-HW05-rsn170330.pdf

@@ -0,0 +1,42 @@
+Problem 1: Program the N­Queen problem in CLP(FD). Follow the structure of the 8 queens problem whose code is given to you.
+
+----------------------------------------------------------------------------------------------------------------------------------
+
+Problem 2: Write a CLP(FD) program to solve all cryptarithmetic addition problems. 
+
+----------------------------------------------------------------------------------------------------------------------------------
+
+Problem 3: Program the Zebra puzzle in CLP(FD).
+
+	Nationality: [Englishman, Spaniard, Japanese, Italian, Norwegian], 
+	Color: [Green, Red, Yellow, Blue, White], 
+	Occupation: [Painter, Diplomat, Violinist, Doctor, Sculptor], 
+	Animal: [Dog, Zebra, Fox, Snail, Horse], 
+	Drink: [Juice, Water, Tea, Coffee, Milk])
+
+	ZEBRA PROBLEM: RULES
+
+	1. The Englishman lives in the red house.
+	2. The Spaniard owns a dog.
+	3. The Japanese is a painter.
+	4. The Italian drinks tea. 
+	5. The Norwegian lives in the first house.
+	6. The owner of the green house drinks coffee.
+	7. The green house is on the right of the white house.
+	8. The sculptor breeds the snail.
+	9. The diplomat lives in the yellow house.
+	10. Milk is drunk in the middle house.
+	11. The Norwegian's house is next to the blue one.
+	12. Violinist drinks fruit juice.
+	13. The fox is in the house next to that of the doctor.
+	14. The horse is in the house next to that of the diplomat.
+
+----------------------------------------------------------------------------------------------------------------------------------
+
+Problem 4: Program the Sudoku Puzzle in CLF(FD). You should read input from the user which consists of a series of terms of the 
+form: f(X,Y,Z). in a file called ”input”. 
+
+The term f(X,Y,Z) states that the square at position (X, Y) has value Z (Z  ∈  1..9). The input file is used to indicates the 
+values given at the various squares in the puzzle. Your program should print the solution on the screen using write statements. 
+
+----------------------------------------------------------------------------------------------------------------------------------

LP05-Constraint-Logic-Programming-CLPFD/hw5q3.lp

@@ -10,58 +10,58 @@
 % the list of numbers [1,2,3,..,N].
 
 queens(N,Qs) :- 
-	range(1,N,Ns), permutation(Ns,Qs), safe(Qs).
+    range(1,N,Ns), permutation(Ns,Qs), safe(Qs).
 
 % The placement Qs is safe/ valid.
 safe([]).
 safe([Q|Qs]) :- 
-	safe(Qs), \+ attack(Q,Qs).
+    safe(Qs), \+ attack(Q,Qs).
 
 attack(X,Xs) :- attack(X,1,Xs).
 attack(X,N,[Y|_]) :- 
-	X #= Y+N; X #= Y-N.
+    X #= Y+N; X #= Y-N.
 attack(X,N,[_|Ys]) :- 
-	N1 #= N+1, attack(X,N1,Ys).
+    N1 #= N+1, attack(X,N1,Ys).
 
 % permutation(L1,P): P is a permutation of L1
 permutation([],[]).
 permutation(Xs,[Z|Zs]) :-
-	select(Z,Xs,Ys), permutation(Ys,Zs).
+    select(Z,Xs,Ys), permutation(Ys,Zs).
 
 % range(M,N,List): List is list of integers [M,N], M<N.
 range(N,N,[N]).
 range(M,N,[M|Ns]) :- 
-	M #< N, M1 #= M+1, range(M1,N,Ns).
+    M #< N, M1 #= M+1, range(M1,N,Ns).
 
 % select(X,List,R): R #= a List with one removed X
 select(X,[X|T],T).
 select(X,[H|T],[H|R]) :- %X \= H, 
-	select(X,T,R).
+    select(X,T,R).
 
 %----------------------------------------------------------
 % n_queens(N,Queens), label(Queens) same as 
 % queens(N,Queens), but USING CLPFD inbuilt functions.
 
 n_queens(N, Qs) :-
-	length(Qs, N),
-	%in place of range and premutation.
-	Qs ins 1..N,
-	safe_queens(Qs).
+    length(Qs, N),
+    %in place of range and premutation.
+    Qs ins 1..N,
+    safe_queens(Qs).
 
 safe_queens([]).
 safe_queens([Q|Qs]) :- 
-	safe_queens(Qs, Q, 1), 
-	safe_queens(Qs).
+    safe_queens(Qs, Q, 1), 
+    safe_queens(Qs).
 
 safe_queens([], _, _).
 safe_queens([Q|Qs], Q0, D0) :- 
-	%not in same row
-	Q0 #\= Q,
-	%diagonally safe
-	abs(Q0 - Q) #\= D0,
-	D1 #= D0 + 1,
-	%recursive check
-	safe_queens(Qs, Q0, D1).
+    %not in same row
+    Q0 #\= Q,
+    %diagonally safe
+    abs(Q0 - Q) #\= D0,
+    D1 #= D0 + 1,
+    %recursive check
+    safe_queens(Qs, Q0, D1).
 
 %----------------------- COMMANDS -------------------------
 

LP05-Constraint-Logic-Programming-CLPFD/hw5q4.lp

@@ -7,43 +7,43 @@
 %-------------------------- Q2 ----------------------------
 % Solves generic cryptarithmetic problems of any length for
 % producing third list as sum of two lists.
-%	    E A T
-% + 	  T H A T
-%-----------------
-%  	A P P L E	
+%       E A T
+% +   T H A T
+%-------------
+%   A P P L E   
 
 genCrypt([H1|T1] + [H2|T2] = [H3|T3]):- 
-	%combines all varibales
-	append([H1|T1],[H2|T2],Temp), 
-	append(Temp,[H3|T3],Duplicates),
-
-	%produce a distinct set
-	list_to_set(Duplicates,DistictSet),
-	%setting up the domains
-	DistictSet ins 0..9, 
-	%making all of them different
-	all_distinct(DistictSet), 
-
-	% trivial
-	H1 #> 0, H2 #> 0, H3 #> 0,
-	
-	%evaluating their values
-	value([H1|T1],S1), 
-	value([H2|T2],S2), 
-	value([H3|T3],S3), 
-	S3 #= S1 + S2,
-
-	%printing them
-	labeling([],DistictSet).
+    %combines all varibales
+    append([H1|T1],[H2|T2],Temp), 
+    append(Temp,[H3|T3],Duplicates),
+
+    %produce a distinct set
+    list_to_set(Duplicates,DistictSet),
+    %setting up the domains
+    DistictSet ins 0..9, 
+    %making all of them different
+    all_distinct(DistictSet), 
+
+    % trivial
+    H1 #> 0, H2 #> 0, H3 #> 0,
+    
+    %evaluating their values
+    value([H1|T1],S1), 
+    value([H2|T2],S2), 
+    value([H3|T3],S3), 
+    S3 #= S1 + S2,
+
+    %printing them
+    labeling([],DistictSet).
 
 % value([1,2,3],123). true.
 value([],0).
 value([H|T],V) :- 
-	length(T,L), Base #= 10^L, 
-	BaseValue #= Base * H,
-	
-	V #= V1 + BaseValue,
-	value(T,V1).
+    length(T,L), Base #= 10^L, 
+    BaseValue #= Base * H,
+    
+    V #= V1 + BaseValue,
+    value(T,V1).
 
 %----------------------- COMMANDS -------------------------