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,g,t,d,a,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=g, Param3=t, Param4=d, Param5=a, 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=g, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=g, 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=g, Param3=t, Param4=d, Param5=a, Param6=FreeVariable (variable) , ]
| 1,600 |
|
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,g,t,o,Var2,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=g, 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=g, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=g, 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=g, Param3=t, Param4=o, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,601 |
|
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,h,Var1,b,l,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=b, Param5=l, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=b, Param5=l, Param6=FreeVariable (variable) , ]
| 1,602 |
|
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,h,Var1,c,o,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=c, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=c, Param5=o, Param6=FreeVariable (variable) , ]
| 1,603 |
|
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,h,Var1,g,t,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=g, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=g, Param5=t, Param6=FreeVariable (variable) , ]
| 1,604 |
|
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,h,Var2,b,t,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=b, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=b, Param5=t, Param6=m, ]
| 1,605 |
|
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,h,Var2,c,a,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=c, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=c, Param5=a, Param6=m, ]
| 1,606 |
|
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,h,Var2,d,Var4,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=d, Param5=FreeVariable (variable) , Param6=c, ]
| 1,607 |
|
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,h,Var2,d,e,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=d, Param5=e, Param6=r, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=d, Param5=e, Param6=r, ]
| 1,608 |
|
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,h,Var2,e,t,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=e, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=e, Param5=t, Param6=FreeVariable (variable) , ]
| 1,609 |
|
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,h,Var2,m,Var4,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=m, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,610 |
|
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,h,Var3,Var1,e,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=e, Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=e, Param6=n, ]
| 1,611 |
|
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,h,Var3,Var4,Var5,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=n, ]
| 1,612 |
|
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,h,Var3,b,a,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=b, Param5=a, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=b, Param5=a, Param6=c, ]
| 1,613 |
|
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,h,Var3,b,m,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=b, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=b, Param5=m, Param6=FreeVariable (variable) , ]
| 1,614 |
|
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,h,Var3,c,n,a).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=c, Param5=n, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=c, Param5=n, Param6=a, ]
| 1,615 |
|
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,h,Var3,g,m,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=g, Param5=m, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=g, Param5=m, Param6=e, ]
| 1,616 |
|
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,h,Var4,Var1,c,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=c, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=c, Param6=m, ]
| 1,617 |
|
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,h,Var4,Var2,a,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=a, Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=a, Param6=o, ]
| 1,618 |
|
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,h,Var4,Var2,o,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=o, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=o, Param6=m, ]
| 1,619 |
|
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,h,Var4,Var5,b,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=b, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=b, Param6=e, ]
| 1,620 |
|
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,h,Var4,a,o,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=a, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=a, Param5=o, Param6=c, ]
| 1,621 |
|
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,h,Var4,m,Var3,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=m, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=m, Param5=FreeVariable (variable) , Param6=r, ]
| 1,622 |
|
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,h,Var4,m,Var5,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=m, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=m, Param5=FreeVariable (variable) , Param6=e, ]
| 1,623 |
|
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,h,Var4,n,Var5,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=n, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,624 |
|
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,h,Var4,o,Var3,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=o, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=o, Param5=FreeVariable (variable) , Param6=m, ]
| 1,625 |
|
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,h,Var4,o,Var5,a).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=o, Param5=FreeVariable (variable) , Param6=a, ]
| 1,626 |
|
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,h,Var5,a,Var1,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=a, Param5=FreeVariable (variable) , Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=a, Param5=FreeVariable (variable) , Param6=g, ]
| 1,627 |
|
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,h,Var5,b,a,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=b, Param5=a, Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=b, Param5=a, Param6=o, ]
| 1,628 |
|
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,h,Var5,b,o,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=b, Param5=o, Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=b, Param5=o, Param6=g, ]
| 1,629 |
|
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,h,Var5,b,o,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=b, Param5=o, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=b, Param5=o, Param6=r, ]
| 1,630 |
|
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,h,Var5,c,d,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=c, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=c, Param5=d, Param6=FreeVariable (variable) , ]
| 1,631 |
|
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,h,Var5,c,o,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=c, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=c, Param5=o, Param6=FreeVariable (variable) , ]
| 1,632 |
|
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,h,Var5,e,Var3,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=e, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=e, Param5=FreeVariable (variable) , Param6=g, ]
| 1,633 |
|
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,h,Var5,m,t,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=m, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=m, Param5=t, Param6=o, ]
| 1,634 |
|
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,h,Var5,n,a,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=n, Param5=a, Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=n, Param5=a, Param6=o, ]
| 1,635 |
|
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,h,Var5,o,b,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=o, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=o, Param5=b, Param6=FreeVariable (variable) , ]
| 1,636 |
|
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,h,Var5,o,t,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=FreeVariable (variable) , Param4=o, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=FreeVariable (variable) , Param4=o, Param5=t, Param6=g, ]
| 1,637 |
|
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,h,a,Var3,e,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=a, Param4=FreeVariable (variable) , Param5=e, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=a, Param4=FreeVariable (variable) , Param5=e, Param6=b, ]
| 1,638 |
|
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,h,a,Var5,d,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=a, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=a, Param4=FreeVariable (variable) , Param5=d, Param6=m, ]
| 1,639 |
|
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,h,a,b,g,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=a, Param4=b, Param5=g, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=a, Param4=b, Param5=g, Param6=e, ]
| 1,640 |
|
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,h,a,l,c,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=a, Param4=l, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=a, Param4=l, Param5=c, Param6=FreeVariable (variable) , ]
| 1,641 |
|
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,h,a,n,r,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=a, Param4=n, Param5=r, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=a, Param4=n, Param5=r, Param6=t, ]
| 1,642 |
|
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,h,a,r,Var5,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=a, Param4=r, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=a, Param4=r, Param5=FreeVariable (variable) , Param6=g, ]
| 1,643 |
|
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,h,a,t,d,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=a, Param4=t, Param5=d, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=a, Param4=t, Param5=d, Param6=l, ]
| 1,644 |
|
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,h,b,Var1,Var5,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, Param4=FreeVariable (variable) , 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=t, ]
| 1,645 |
|
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,h,b,Var5,n,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, Param4=FreeVariable (variable) , Param5=n, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=FreeVariable (variable) , Param5=n, Param6=l, ]
| 1,646 |
|
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,h,b,a,m,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, Param4=a, Param5=m, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=a, Param5=m, Param6=t, ]
| 1,647 |
|
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,h,b,e,a,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, Param4=e, Param5=a, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=e, Param5=a, Param6=r, ]
| 1,648 |
|
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,h,b,l,d,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, Param4=l, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=l, Param5=d, Param6=FreeVariable (variable) , ]
| 1,649 |
|
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,h,b,l,t,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, Param4=l, Param5=t, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=l, Param5=t, Param6=n, ]
| 1,650 |
|
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,h,b,m,Var5,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, Param4=m, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=m, Param5=FreeVariable (variable) , Param6=o, ]
| 1,651 |
|
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,h,b,r,Var2,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=r, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,652 |
|
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,h,b,r,d,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, Param4=r, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=r, Param5=d, Param6=FreeVariable (variable) , ]
| 1,653 |
|
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,h,b,t,Var1,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=b, Param4=t, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=b, Param4=t, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,654 |
|
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,h,c,Var1,g,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=c, Param4=FreeVariable (variable) , Param5=g, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=c, Param4=FreeVariable (variable) , Param5=g, Param6=FreeVariable (variable) , ]
| 1,655 |
|
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,h,c,Var2,m,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=c, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=c, Param4=FreeVariable (variable) , Param5=m, Param6=n, ]
| 1,656 |
|
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,h,c,Var5,n,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=c, Param4=FreeVariable (variable) , Param5=n, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=c, Param4=FreeVariable (variable) , Param5=n, Param6=o, ]
| 1,657 |
|
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,h,c,Var5,o,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=c, Param4=FreeVariable (variable) , Param5=o, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=c, Param4=FreeVariable (variable) , Param5=o, Param6=l, ]
| 1,658 |
|
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,h,c,e,Var5,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=c, Param4=e, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=c, Param4=e, Param5=FreeVariable (variable) , Param6=o, ]
| 1,659 |
|
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,h,c,e,Var5,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=c, Param4=e, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=c, Param4=e, Param5=FreeVariable (variable) , Param6=t, ]
| 1,660 |
|
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,h,c,g,b,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=c, Param4=g, Param5=b, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=c, Param4=g, Param5=b, Param6=m, ]
| 1,661 |
|
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,h,c,m,d,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=c, Param4=m, Param5=d, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=c, Param4=m, Param5=d, Param6=l, ]
| 1,662 |
|
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,h,c,t,a,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=c, Param4=t, Param5=a, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=c, Param4=t, Param5=a, Param6=FreeVariable (variable) , ]
| 1,663 |
|
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,h,d,Var1,Var2,a).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, Param4=FreeVariable (variable) , 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=a, ]
| 1,664 |
|
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,h,d,Var2,Var4,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,665 |
|
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,h,d,Var2,e,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, Param4=FreeVariable (variable) , Param5=e, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=FreeVariable (variable) , Param5=e, Param6=b, ]
| 1,666 |
|
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,h,d,b,g,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, Param4=b, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=b, Param5=g, Param6=t, ]
| 1,667 |
|
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,h,d,c,Var5,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=c, Param5=FreeVariable (variable) , Param6=n, ]
| 1,668 |
|
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,h,d,l,Var3,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, Param4=l, Param5=FreeVariable (variable) , Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=l, Param5=FreeVariable (variable) , Param6=g, ]
| 1,669 |
|
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,h,d,n,e,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, Param4=n, Param5=e, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=n, Param5=e, Param6=m, ]
| 1,670 |
|
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,h,d,n,l,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, Param4=n, Param5=l, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=n, Param5=l, Param6=o, ]
| 1,671 |
|
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,h,d,n,o,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, Param4=n, Param5=o, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=n, Param5=o, Param6=m, ]
| 1,672 |
|
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,h,d,o,c,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=d, Param4=o, Param5=c, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=d, Param4=o, Param5=c, Param6=b, ]
| 1,673 |
|
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,h,e,Var1,b,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, Param4=FreeVariable (variable) , Param5=b, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=FreeVariable (variable) , Param5=b, Param6=d, ]
| 1,674 |
|
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,h,e,Var2,Var3,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=n, ]
| 1,675 |
|
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,h,e,Var2,r,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, Param4=FreeVariable (variable) , Param5=r, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=FreeVariable (variable) , Param5=r, Param6=c, ]
| 1,676 |
|
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,h,e,Var5,b,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, Param4=FreeVariable (variable) , Param5=b, Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=FreeVariable (variable) , Param5=b, Param6=n, ]
| 1,677 |
|
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,h,e,a,Var5,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, Param4=a, Param5=FreeVariable (variable) , Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=a, Param5=FreeVariable (variable) , Param6=g, ]
| 1,678 |
|
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,h,e,d,Var5,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, Param4=d, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=d, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,679 |
|
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,h,e,m,a,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, Param4=m, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=m, Param5=a, Param6=g, ]
| 1,680 |
|
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,h,e,o,Var5,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=o, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,681 |
|
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,h,e,t,Var3,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, Param4=t, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=t, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,682 |
|
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,h,e,t,a,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=e, Param4=t, Param5=a, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=e, Param4=t, Param5=a, Param6=c, ]
| 1,683 |
|
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,h,g,Var3,Var5,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=g, Param4=FreeVariable (variable) , 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=g, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=c, ]
| 1,684 |
|
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,h,g,a,m,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=g, Param4=a, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=g, Param4=a, Param5=m, Param6=FreeVariable (variable) , ]
| 1,685 |
|
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,h,g,b,e,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=g, Param4=b, Param5=e, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=g, Param4=b, Param5=e, Param6=m, ]
| 1,686 |
|
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,h,g,m,t,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=g, Param4=m, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=g, Param4=m, Param5=t, Param6=d, ]
| 1,687 |
|
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,h,g,r,a,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=g, Param4=r, Param5=a, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=g, Param4=r, Param5=a, Param6=FreeVariable (variable) , ]
| 1,688 |
|
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,h,g,r,b,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=g, Param4=r, Param5=b, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=g, Param4=r, Param5=b, Param6=l, ]
| 1,689 |
|
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,h,g,r,c,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=g, Param4=r, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=g, Param4=r, Param5=c, Param6=FreeVariable (variable) , ]
| 1,690 |
|
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,h,l,Var5,g,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=l, Param4=FreeVariable (variable) , Param5=g, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=l, Param4=FreeVariable (variable) , Param5=g, Param6=e, ]
| 1,691 |
|
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,h,l,a,c,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=l, Param4=a, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=l, Param4=a, Param5=c, Param6=FreeVariable (variable) , ]
| 1,692 |
|
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,h,l,a,o,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=l, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=l, Param4=a, Param5=o, Param6=FreeVariable (variable) , ]
| 1,693 |
|
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,h,l,c,o,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=l, Param4=c, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=l, Param4=c, Param5=o, Param6=FreeVariable (variable) , ]
| 1,694 |
|
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,h,l,d,o,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=l, Param4=d, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=l, Param4=d, Param5=o, Param6=FreeVariable (variable) , ]
| 1,695 |
|
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,h,l,m,r,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=l, Param4=m, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=l, Param4=m, Param5=r, Param6=FreeVariable (variable) , ]
| 1,696 |
|
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,h,l,o,n,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=l, Param4=o, Param5=n, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=l, Param4=o, Param5=n, Param6=t, ]
| 1,697 |
|
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,h,l,r,a,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=l, Param4=r, Param5=a, Param6=n, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=l, Param4=r, Param5=a, Param6=n, ]
| 1,698 |
|
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,h,l,r,d,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=h, Param3=l, Param4=r, Param5=d, 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=h, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=h, 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=h, Param3=l, Param4=r, Param5=d, Param6=c, ]
| 1,699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.