code_idx
int64 12
284
| code
stringlengths 36
24.7k
| query_type
int64 0
1
| query_code
stringlengths 7
49
| found_solution
bool 2
classes | result_explanation
stringlengths 55
33.4k
| result_variables
stringlengths 0
52
| __index_level_0__
int64 0
194k
|
|---|---|---|---|---|---|---|---|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var1,r,b,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=r, Param5=b, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=r, Param5=b, Param6=m, ]
| 2,500 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,Var1,Var5,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=n, ]
| 2,501 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,Var3,e,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=e, Param6=r, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=e, Param6=r, ]
| 2,502 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,Var3,m,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=m, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=m, Param6=l, ]
| 2,503 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,Var3,r,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=r, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=r, Param6=FreeVariable (variable) , ]
| 2,504 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,Var5,g,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=g, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=g, Param6=b, ]
| 2,505 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,a,r,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=a, Param5=r, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=a, Param5=r, Param6=b, ]
| 2,506 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,b,Var3,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=b, Param5=FreeVariable (variable) , Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=b, Param5=FreeVariable (variable) , Param6=l, ]
| 2,507 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,c,h,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=c, Param5=h, Param6=r, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=c, Param5=h, Param6=r, ]
| 2,508 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,e,Var1,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=e, Param5=FreeVariable (variable) , Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=e, Param5=FreeVariable (variable) , Param6=m, ]
| 2,509 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,g,Var3,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=g, Param5=FreeVariable (variable) , Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=g, Param5=FreeVariable (variable) , Param6=l, ]
| 2,510 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,g,r,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=g, Param5=r, Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=g, Param5=r, Param6=h, ]
| 2,511 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var2,m,h,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=m, Param5=h, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=m, Param5=h, Param6=FreeVariable (variable) , ]
| 2,512 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var3,Var1,l,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=l, Param6=c, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=l, Param6=c, ]
| 2,513 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var3,a,Var5,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=a, Param5=FreeVariable (variable) , Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=a, Param5=FreeVariable (variable) , Param6=g, ]
| 2,514 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var3,b,e,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=b, Param5=e, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=b, Param5=e, Param6=FreeVariable (variable) , ]
| 2,515 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var3,c,Var4,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=c, Param5=FreeVariable (variable) , Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=c, Param5=FreeVariable (variable) , Param6=m, ]
| 2,516 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var3,g,m,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=g, Param5=m, Param6=d, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=g, Param5=m, Param6=d, ]
| 2,517 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var3,h,Var1,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=h, Param5=FreeVariable (variable) , Param6=c, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=h, Param5=FreeVariable (variable) , Param6=c, ]
| 2,518 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var4,Var3,e,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=e, Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=e, Param6=n, ]
| 2,519 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var4,Var5,Var1,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=r, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=r, ]
| 2,520 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var4,a,l,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=a, Param5=l, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=a, Param5=l, Param6=m, ]
| 2,521 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var4,e,m,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=e, Param5=m, Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=e, Param5=m, Param6=g, ]
| 2,522 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var4,g,m,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=g, Param5=m, Param6=c, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=g, Param5=m, Param6=c, ]
| 2,523 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var4,l,b,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=l, Param5=b, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=l, Param5=b, Param6=FreeVariable (variable) , ]
| 2,524 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var4,r,Var1,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=r, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=r, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 2,525 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var4,r,Var3,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=r, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=r, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 2,526 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var4,r,b,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=r, Param5=b, Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=r, Param5=b, Param6=g, ]
| 2,527 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var5,Var2,g,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=g, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=g, Param6=FreeVariable (variable) , ]
| 2,528 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var5,b,n,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=b, Param5=n, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=b, Param5=n, Param6=FreeVariable (variable) , ]
| 2,529 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,Var5,o,n,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=o, Param5=n, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=FreeVariable (variable) , Param4=o, Param5=n, Param6=m, ]
| 2,530 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,a,Var1,Var2,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=o, ]
| 2,531 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,a,Var5,Var2,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=b, ]
| 2,532 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,a,b,e,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=b, Param5=e, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=b, Param5=e, Param6=FreeVariable (variable) , ]
| 2,533 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,a,b,o,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=b, Param5=o, Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=b, Param5=o, Param6=g, ]
| 2,534 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,a,b,r,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=b, Param5=r, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=b, Param5=r, Param6=FreeVariable (variable) , ]
| 2,535 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,a,g,o,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=g, Param5=o, Param6=c, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=g, Param5=o, Param6=c, ]
| 2,536 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,a,n,r,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=n, Param5=r, Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=a, Param4=n, Param5=r, Param6=o, ]
| 2,537 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,Var1,o,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=FreeVariable (variable) , Param5=o, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=FreeVariable (variable) , Param5=o, Param6=FreeVariable (variable) , ]
| 2,538 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,Var2,r,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=FreeVariable (variable) , Param5=r, Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=FreeVariable (variable) , Param5=r, Param6=o, ]
| 2,539 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,Var5,n,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=FreeVariable (variable) , Param5=n, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=FreeVariable (variable) , Param5=n, Param6=FreeVariable (variable) , ]
| 2,540 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,a,h,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=a, Param5=h, Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=a, Param5=h, Param6=g, ]
| 2,541 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,c,a,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=c, Param5=a, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=c, Param5=a, Param6=l, ]
| 2,542 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,e,m,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=e, Param5=m, Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=e, Param5=m, Param6=o, ]
| 2,543 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,l,Var1,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=l, Param5=FreeVariable (variable) , Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=l, Param5=FreeVariable (variable) , Param6=g, ]
| 2,544 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,l,Var2,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=l, Param5=FreeVariable (variable) , Param6=r, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=l, Param5=FreeVariable (variable) , Param6=r, ]
| 2,545 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,m,a,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=m, Param5=a, Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=m, Param5=a, Param6=o, ]
| 2,546 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,b,o,c,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=o, Param5=c, Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=b, Param4=o, Param5=c, Param6=n, ]
| 2,547 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,Var1,a,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=a, Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=a, Param6=n, ]
| 2,548 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,Var2,h,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=h, Param6=r, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=h, Param6=r, ]
| 2,549 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,Var2,l,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=l, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=l, Param6=FreeVariable (variable) , ]
| 2,550 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,Var2,l,a).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=l, Param6=a, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=l, Param6=a, ]
| 2,551 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,Var2,l,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=l, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=FreeVariable (variable) , Param5=l, Param6=m, ]
| 2,552 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,a,Var5,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=a, Param5=FreeVariable (variable) , Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=a, Param5=FreeVariable (variable) , Param6=b, ]
| 2,553 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,a,e,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=a, Param5=e, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=a, Param5=e, Param6=b, ]
| 2,554 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,a,l,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=a, Param5=l, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=a, Param5=l, Param6=b, ]
| 2,555 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,d,a,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=d, Param5=a, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=d, Param5=a, Param6=l, ]
| 2,556 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,c,r,b,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=r, Param5=b, Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=c, Param4=r, Param5=b, Param6=n, ]
| 2,557 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,Var1,Var4,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 2,558 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,Var1,Var5,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=h, ]
| 2,559 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,a,Var2,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=a, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=a, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 2,560 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,a,g,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=a, Param5=g, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=a, Param5=g, Param6=b, ]
| 2,561 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,b,Var4,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=b, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=b, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 2,562 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,b,l,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=b, Param5=l, Param6=r, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=b, Param5=l, Param6=r, ]
| 2,563 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,c,a,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=c, Param5=a, Param6=e, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=c, Param5=a, Param6=e, ]
| 2,564 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,c,n,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=c, Param5=n, Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=c, Param5=n, Param6=g, ]
| 2,565 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,e,l,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=e, Param5=l, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=e, Param5=l, Param6=m, ]
| 2,566 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,h,b,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=h, Param5=b, Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=h, Param5=b, Param6=n, ]
| 2,567 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,m,g,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=m, Param5=g, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=m, Param5=g, Param6=FreeVariable (variable) , ]
| 2,568 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,n,Var3,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=n, Param5=FreeVariable (variable) , Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=n, Param5=FreeVariable (variable) , Param6=b, ]
| 2,569 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,d,o,c,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=o, Param5=c, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=d, Param4=o, Param5=c, Param6=FreeVariable (variable) , ]
| 2,570 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,e,Var2,h,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=FreeVariable (variable) , Param5=h, Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=FreeVariable (variable) , Param5=h, Param6=n, ]
| 2,571 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,e,Var3,g,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=FreeVariable (variable) , Param5=g, Param6=c, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=FreeVariable (variable) , Param5=g, Param6=c, ]
| 2,572 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,e,Var3,m,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=FreeVariable (variable) , Param5=m, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=FreeVariable (variable) , Param5=m, Param6=FreeVariable (variable) , ]
| 2,573 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,e,b,Var2,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=b, Param5=FreeVariable (variable) , Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=b, Param5=FreeVariable (variable) , Param6=g, ]
| 2,574 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,e,m,l,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=m, Param5=l, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=m, Param5=l, Param6=FreeVariable (variable) , ]
| 2,575 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,e,n,l,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=n, Param5=l, Param6=d, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=n, Param5=l, Param6=d, ]
| 2,576 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,e,n,r,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=n, Param5=r, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=e, Param4=n, Param5=r, Param6=FreeVariable (variable) , ]
| 2,577 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,g,Var3,Var5,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 2,578 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,g,Var3,l,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=FreeVariable (variable) , Param5=l, Param6=e, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=FreeVariable (variable) , Param5=l, Param6=e, ]
| 2,579 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,g,a,c,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=a, Param5=c, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=a, Param5=c, Param6=b, ]
| 2,580 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,g,c,d,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=c, Param5=d, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=c, Param5=d, Param6=b, ]
| 2,581 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,g,e,n,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=e, Param5=n, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=e, Param5=n, Param6=m, ]
| 2,582 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,g,m,h,a).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=m, Param5=h, Param6=a, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=m, Param5=h, Param6=a, ]
| 2,583 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,g,n,b,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=n, Param5=b, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=n, Param5=b, Param6=m, ]
| 2,584 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,g,r,Var1,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=r, Param5=FreeVariable (variable) , Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=r, Param5=FreeVariable (variable) , Param6=h, ]
| 2,585 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,g,r,a,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=r, Param5=a, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=g, Param4=r, Param5=a, Param6=l, ]
| 2,586 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,h,Var1,a,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=a, Param6=e, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=a, Param6=e, ]
| 2,587 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,h,Var3,Var2,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=b, ]
| 2,588 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,h,Var5,c,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=c, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=c, Param6=FreeVariable (variable) , ]
| 2,589 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,h,Var5,d,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=d, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=d, Param6=m, ]
| 2,590 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,h,Var5,g,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=g, Param6=c, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=FreeVariable (variable) , Param5=g, Param6=c, ]
| 2,591 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,h,b,Var5,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=b, Param5=FreeVariable (variable) , Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=b, Param5=FreeVariable (variable) , Param6=o, ]
| 2,592 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,h,c,Var2,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=c, Param5=FreeVariable (variable) , Param6=e, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=c, Param5=FreeVariable (variable) , Param6=e, ]
| 2,593 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,h,c,Var5,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=c, Param5=FreeVariable (variable) , Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=c, Param5=FreeVariable (variable) , Param6=g, ]
| 2,594 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,h,l,c,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=l, Param5=c, Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=h, Param4=l, Param5=c, Param6=g, ]
| 2,595 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,l,Var1,c,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=l, Param4=FreeVariable (variable) , Param5=c, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=l, Param4=FreeVariable (variable) , Param5=c, Param6=FreeVariable (variable) , ]
| 2,596 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,l,Var5,b,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=l, Param4=FreeVariable (variable) , Param5=b, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=l, Param4=FreeVariable (variable) , Param5=b, Param6=FreeVariable (variable) , ]
| 2,597 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,l,c,r,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=l, Param4=c, Param5=r, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=l, Param4=c, Param5=r, Param6=FreeVariable (variable) , ]
| 2,598 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,t,l,d,h,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=l, Param4=d, Param5=h, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=t, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=t, Param3=l, Param4=d, Param5=h, Param6=FreeVariable (variable) , ]
| 2,599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.