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,l,a,t,Var3,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=a, Param4=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=a, Param4=t, Param5=FreeVariable (variable) , Param6=o, ]
| 1,800 |
|
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,l,b,Var3,o,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=b, Param4=FreeVariable (variable) , 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=b, Param4=FreeVariable (variable) , Param5=o, Param6=c, ]
| 1,801 |
|
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,l,b,a,Var1,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=b, Param4=a, Param5=FreeVariable (variable) , 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=b, Param4=a, Param5=FreeVariable (variable) , Param6=d, ]
| 1,802 |
|
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,l,b,e,Var4,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=b, Param4=e, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=b, Param4=e, Param5=FreeVariable (variable) , Param6=r, ]
| 1,803 |
|
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,l,b,m,Var4,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=b, Param4=m, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=b, Param4=m, Param5=FreeVariable (variable) , Param6=c, ]
| 1,804 |
|
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,l,b,o,Var1,a).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=b, Param4=o, Param5=FreeVariable (variable) , 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=b, Param4=o, Param5=FreeVariable (variable) , Param6=a, ]
| 1,805 |
|
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,l,b,r,Var3,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=b, Param4=r, Param5=FreeVariable (variable) , Param6=t, ]
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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=b, Param4=r, Param5=FreeVariable (variable) , Param6=t, ]
| 1,806 |
|
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,l,b,r,g,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=b, Param4=r, Param5=g, Param6=t, ]
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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=b, Param4=r, Param5=g, Param6=t, ]
| 1,807 |
|
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,l,b,t,n,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=b, Param4=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=b, Param4=t, Param5=n, Param6=FreeVariable (variable) , ]
| 1,808 |
|
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,l,c,b,g,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=c, Param4=b, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=c, Param4=b, Param5=g, Param6=FreeVariable (variable) , ]
| 1,809 |
|
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,l,c,e,t,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=c, Param4=e, Param5=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=c, Param4=e, Param5=t, Param6=g, ]
| 1,810 |
|
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,l,c,n,Var2,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=c, Param4=n, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=c, Param4=n, Param5=FreeVariable (variable) , Param6=e, ]
| 1,811 |
|
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,l,c,o,Var2,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=c, Param4=o, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=c, Param4=o, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,812 |
|
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,l,c,o,Var2,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=c, Param4=o, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=c, Param4=o, Param5=FreeVariable (variable) , Param6=h, ]
| 1,813 |
|
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,l,c,o,Var5,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=c, Param4=o, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=c, Param4=o, Param5=FreeVariable (variable) , Param6=e, ]
| 1,814 |
|
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,l,c,r,g,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=c, Param4=r, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=c, Param4=r, Param5=g, Param6=FreeVariable (variable) , ]
| 1,815 |
|
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,l,c,t,g,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=c, Param4=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=c, Param4=t, Param5=g, Param6=FreeVariable (variable) , ]
| 1,816 |
|
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,l,c,t,g,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=c, Param4=t, Param5=g, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=c, Param4=t, Param5=g, Param6=m, ]
| 1,817 |
|
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,l,d,Var2,e,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, Param4=FreeVariable (variable) , 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=FreeVariable (variable) , Param5=e, Param6=FreeVariable (variable) , ]
| 1,818 |
|
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,l,d,Var2,m,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=FreeVariable (variable) , Param5=m, Param6=FreeVariable (variable) , ]
| 1,819 |
|
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,l,d,Var3,Var1,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=r, ]
| 1,820 |
|
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,l,d,Var3,Var4,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, Param4=FreeVariable (variable) , 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=g, ]
| 1,821 |
|
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,l,d,Var4,g,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, Param4=FreeVariable (variable) , Param5=g, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=FreeVariable (variable) , Param5=g, Param6=o, ]
| 1,822 |
|
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,l,d,Var5,c,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, Param4=FreeVariable (variable) , Param5=c, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=FreeVariable (variable) , Param5=c, Param6=e, ]
| 1,823 |
|
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,l,d,a,o,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, Param4=a, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=a, Param5=o, Param6=FreeVariable (variable) , ]
| 1,824 |
|
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,l,d,e,t,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, Param4=e, Param5=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=e, Param5=t, Param6=c, ]
| 1,825 |
|
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,l,d,n,Var2,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, Param4=n, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=n, Param5=FreeVariable (variable) , Param6=m, ]
| 1,826 |
|
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,l,d,o,g,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=d, Param4=o, Param5=g, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=d, Param4=o, Param5=g, Param6=m, ]
| 1,827 |
|
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,l,e,Var1,a,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=FreeVariable (variable) , Param5=a, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=FreeVariable (variable) , Param5=a, Param6=m, ]
| 1,828 |
|
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,l,e,Var2,Var1,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=o, ]
| 1,829 |
|
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,l,e,Var3,Var4,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=d, ]
| 1,830 |
|
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,l,e,b,m,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=b, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=b, Param5=m, Param6=o, ]
| 1,831 |
|
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,l,e,c,Var3,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=c, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=c, Param5=FreeVariable (variable) , Param6=n, ]
| 1,832 |
|
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,l,e,d,t,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=d, Param5=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=d, Param5=t, Param6=FreeVariable (variable) , ]
| 1,833 |
|
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,l,e,m,Var3,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=m, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=m, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,834 |
|
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,l,e,n,Var5,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=n, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=n, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,835 |
|
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,l,e,n,r,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=n, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=n, Param5=r, Param6=h, ]
| 1,836 |
|
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,l,e,r,Var1,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=r, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=r, Param5=FreeVariable (variable) , Param6=m, ]
| 1,837 |
|
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,l,e,t,m,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=e, Param4=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=e, Param4=t, Param5=m, Param6=c, ]
| 1,838 |
|
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,l,g,Var3,m,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=g, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=g, Param4=FreeVariable (variable) , Param5=m, Param6=FreeVariable (variable) , ]
| 1,839 |
|
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,l,g,Var5,r,a).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=g, Param4=FreeVariable (variable) , Param5=r, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=g, Param4=FreeVariable (variable) , Param5=r, Param6=a, ]
| 1,840 |
|
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,l,g,e,Var2,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=g, Param4=e, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=g, Param4=e, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,841 |
|
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,l,g,n,a,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=g, Param4=n, Param5=a, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=g, Param4=n, Param5=a, Param6=h, ]
| 1,842 |
|
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,l,g,n,h,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=g, Param4=n, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=g, Param4=n, Param5=h, Param6=FreeVariable (variable) , ]
| 1,843 |
|
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,l,g,t,Var1,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=g, Param4=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=g, Param4=t, Param5=FreeVariable (variable) , Param6=c, ]
| 1,844 |
|
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,l,h,Var3,t,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=h, Param4=FreeVariable (variable) , Param5=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=h, Param4=FreeVariable (variable) , Param5=t, Param6=d, ]
| 1,845 |
|
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,l,h,d,Var1,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=h, Param4=d, Param5=FreeVariable (variable) , Param6=t, ]
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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=h, Param4=d, Param5=FreeVariable (variable) , Param6=t, ]
| 1,846 |
|
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,l,h,g,c,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=h, Param4=g, Param5=c, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=h, Param4=g, Param5=c, Param6=d, ]
| 1,847 |
|
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,l,h,m,g,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=h, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=h, Param4=m, Param5=g, Param6=FreeVariable (variable) , ]
| 1,848 |
|
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,l,h,n,a,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=h, Param4=n, Param5=a, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=h, Param4=n, Param5=a, Param6=g, ]
| 1,849 |
|
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,l,h,o,t,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=h, Param4=o, Param5=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=h, Param4=o, Param5=t, Param6=FreeVariable (variable) , ]
| 1,850 |
|
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,l,h,o,t,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=h, Param4=o, Param5=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=h, Param4=o, Param5=t, Param6=m, ]
| 1,851 |
|
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,l,h,r,Var1,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=h, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=h, Param4=r, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,852 |
|
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,l,h,r,c,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=h, Param4=r, Param5=c, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=h, Param4=r, Param5=c, Param6=o, ]
| 1,853 |
|
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,l,m,Var3,h,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=m, Param4=FreeVariable (variable) , 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=m, Param4=FreeVariable (variable) , Param5=h, Param6=FreeVariable (variable) , ]
| 1,854 |
|
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,l,m,Var5,a,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=m, Param4=FreeVariable (variable) , Param5=a, Param6=t, ]
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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=m, Param4=FreeVariable (variable) , Param5=a, Param6=t, ]
| 1,855 |
|
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,l,m,c,Var3,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=m, Param4=c, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=m, Param4=c, Param5=FreeVariable (variable) , Param6=r, ]
| 1,856 |
|
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,l,m,c,b,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=m, Param4=c, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=m, Param4=c, Param5=b, Param6=FreeVariable (variable) , ]
| 1,857 |
|
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,l,m,e,Var1,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=m, Param4=e, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=m, Param4=e, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,858 |
|
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,l,m,o,Var1,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=m, Param4=o, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=m, Param4=o, Param5=FreeVariable (variable) , Param6=g, ]
| 1,859 |
|
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,l,m,t,Var2,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=m, Param4=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=m, Param4=t, Param5=FreeVariable (variable) , Param6=r, ]
| 1,860 |
|
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,l,n,Var1,Var2,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=n, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=n, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,861 |
|
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,l,n,Var1,c,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=n, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=n, Param4=FreeVariable (variable) , Param5=c, Param6=FreeVariable (variable) , ]
| 1,862 |
|
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,l,n,Var4,Var5,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=n, Param4=FreeVariable (variable) , 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=n, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=g, ]
| 1,863 |
|
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,l,n,Var4,b,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=n, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=n, Param4=FreeVariable (variable) , Param5=b, Param6=FreeVariable (variable) , ]
| 1,864 |
|
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,l,n,d,Var3,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=n, Param4=d, Param5=FreeVariable (variable) , Param6=t, ]
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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=n, Param4=d, Param5=FreeVariable (variable) , Param6=t, ]
| 1,865 |
|
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,l,n,d,c,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=n, Param4=d, Param5=c, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=n, Param4=d, Param5=c, Param6=h, ]
| 1,866 |
|
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,l,n,g,d,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=n, Param4=g, Param5=d, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=n, Param4=g, Param5=d, Param6=FreeVariable (variable) , ]
| 1,867 |
|
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,l,n,o,h,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=n, Param4=o, Param5=h, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=n, Param4=o, Param5=h, Param6=c, ]
| 1,868 |
|
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,l,n,r,m,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=n, Param4=r, Param5=m, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=n, Param4=r, Param5=m, Param6=b, ]
| 1,869 |
|
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,l,o,b,g,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=o, Param4=b, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=o, Param4=b, Param5=g, Param6=FreeVariable (variable) , ]
| 1,870 |
|
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,l,o,g,Var5,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=o, Param4=g, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=o, Param4=g, Param5=FreeVariable (variable) , Param6=c, ]
| 1,871 |
|
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,l,o,g,a,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=o, Param4=g, Param5=a, Param6=t, ]
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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=o, Param4=g, Param5=a, Param6=t, ]
| 1,872 |
|
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,l,o,h,t,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=o, Param4=h, Param5=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=o, Param4=h, Param5=t, Param6=b, ]
| 1,873 |
|
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,l,r,Var1,m,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=FreeVariable (variable) , Param5=m, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=FreeVariable (variable) , Param5=m, Param6=n, ]
| 1,874 |
|
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,l,r,Var3,Var4,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=o, ]
| 1,875 |
|
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,l,r,Var3,d,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=FreeVariable (variable) , Param5=d, Param6=m, ]
| 1,876 |
|
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,l,r,Var3,t,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=FreeVariable (variable) , Param5=t, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=FreeVariable (variable) , Param5=t, Param6=o, ]
| 1,877 |
|
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,l,r,a,Var2,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=a, Param5=FreeVariable (variable) , Param6=t, ]
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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=a, Param5=FreeVariable (variable) , Param6=t, ]
| 1,878 |
|
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,l,r,e,Var1,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=e, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=e, Param5=FreeVariable (variable) , Param6=b, ]
| 1,879 |
|
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,l,r,e,Var4,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=e, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=e, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,880 |
|
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,l,r,g,h,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=g, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=g, Param5=h, Param6=FreeVariable (variable) , ]
| 1,881 |
|
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,l,r,m,Var5,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=m, Param5=FreeVariable (variable) , Param6=t, ]
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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=m, Param5=FreeVariable (variable) , Param6=t, ]
| 1,882 |
|
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,l,r,m,g,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=m, Param5=g, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=m, Param5=g, Param6=h, ]
| 1,883 |
|
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,l,r,m,h,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=m, Param5=h, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=m, Param5=h, Param6=c, ]
| 1,884 |
|
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,l,r,n,m,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=n, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=n, Param5=m, Param6=FreeVariable (variable) , ]
| 1,885 |
|
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,l,r,o,b,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=r, Param4=o, Param5=b, Param6=t, ]
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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=r, Param4=o, Param5=b, Param6=t, ]
| 1,886 |
|
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,l,t,c,n,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=t, Param4=c, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=t, Param4=c, Param5=n, Param6=m, ]
| 1,887 |
|
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,l,t,h,c,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=t, Param4=h, Param5=c, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=t, Param4=h, Param5=c, Param6=d, ]
| 1,888 |
|
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,l,t,h,o,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=t, Param4=h, Param5=o, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=t, Param4=h, Param5=o, Param6=e, ]
| 1,889 |
|
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,l,t,o,Var1,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=t, Param4=o, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=t, Param4=o, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,890 |
|
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,l,t,o,n,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=t, Param4=o, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=t, Param4=o, Param5=n, Param6=FreeVariable (variable) , ]
| 1,891 |
|
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,l,t,o,n,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=l, Param3=t, Param4=o, 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=l, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=l, 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=l, Param3=t, Param4=o, Param5=n, Param6=FreeVariable (variable) , ]
| 1,892 |
|
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,m,Var1,Var3,d,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=m, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=d, 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=m, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=m, 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=m, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=d, Param6=FreeVariable (variable) , ]
| 1,893 |
|
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,m,Var1,Var3,o,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=m, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=o, 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=m, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=m, 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=m, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=o, Param6=b, ]
| 1,894 |
|
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,m,Var1,Var4,n,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=m, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=n, 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=m, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=m, 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=m, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=n, Param6=c, ]
| 1,895 |
|
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,m,Var1,a,Var4,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=m, Param3=FreeVariable (variable) , Param4=a, 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=m, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=m, 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=m, Param3=FreeVariable (variable) , Param4=a, Param5=FreeVariable (variable) , Param6=c, ]
| 1,896 |
|
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,m,Var1,a,r,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=m, Param3=FreeVariable (variable) , Param4=a, 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=m, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=m, 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=m, Param3=FreeVariable (variable) , Param4=a, Param5=r, Param6=FreeVariable (variable) , ]
| 1,897 |
|
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,m,Var1,c,h,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=m, Param3=FreeVariable (variable) , Param4=c, Param5=h, 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=m, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=m, 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=m, Param3=FreeVariable (variable) , Param4=c, Param5=h, Param6=e, ]
| 1,898 |
|
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,m,Var1,d,Var2,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=m, Param3=FreeVariable (variable) , Param4=d, 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=m, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=m, 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=m, Param3=FreeVariable (variable) , Param4=d, Param5=FreeVariable (variable) , Param6=c, ]
| 1,899 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.