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,c,a,m,n,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=a, Param4=m, Param5=n, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=a, Param4=m, Param5=n, Param6=FreeVariable (variable) , ]
| 1,100 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,a,r,Var1,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=a, Param4=r, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=a, Param4=r, Param5=FreeVariable (variable) , Param6=n, ]
| 1,101 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,a,t,d,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=a, Param4=t, Param5=d, Param6=l, ]
| 1,102 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,b,Var4,Var5,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,103 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,b,d,e,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, Param4=d, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, Param4=d, Param5=e, Param6=m, ]
| 1,104 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,b,h,o,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, Param4=h, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, Param4=h, Param5=o, Param6=m, ]
| 1,105 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,b,m,o,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, Param4=m, Param5=o, Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, Param4=m, Param5=o, Param6=h, ]
| 1,106 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,b,o,t,m).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, Param4=o, Param5=t, Param6=m, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=b, Param4=o, Param5=t, Param6=m, ]
| 1,107 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,d,Var1,m,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=FreeVariable (variable) , Param5=m, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=FreeVariable (variable) , Param5=m, Param6=b, ]
| 1,108 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,d,Var4,Var5,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,109 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,d,Var4,b,a).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=FreeVariable (variable) , Param5=b, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=FreeVariable (variable) , Param5=b, Param6=a, ]
| 1,110 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,d,Var4,t,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=FreeVariable (variable) , 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=FreeVariable (variable) , Param5=t, Param6=FreeVariable (variable) , ]
| 1,111 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,d,e,h,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=e, Param5=h, Param6=r, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=e, Param5=h, Param6=r, ]
| 1,112 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,d,h,Var3,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=h, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=h, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,113 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,d,h,o,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=h, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=h, Param5=o, Param6=g, ]
| 1,114 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,d,o,l,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=o, Param5=l, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=d, Param4=o, Param5=l, Param6=b, ]
| 1,115 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,Var1,Var5,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=b, ]
| 1,116 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,Var1,t,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=FreeVariable (variable) , Param5=t, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=FreeVariable (variable) , Param5=t, Param6=l, ]
| 1,117 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,Var2,a,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=FreeVariable (variable) , 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=FreeVariable (variable) , Param5=a, Param6=FreeVariable (variable) , ]
| 1,118 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,Var4,Var2,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=o, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=o, ]
| 1,119 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,d,m,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=d, Param5=m, Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=d, Param5=m, Param6=l, ]
| 1,120 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,h,o,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=h, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=h, Param5=o, Param6=FreeVariable (variable) , ]
| 1,121 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,m,Var4,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=m, Param5=FreeVariable (variable) , Param6=r, ]
| 1,122 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,n,l,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=n, Param5=l, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=n, Param5=l, Param6=t, ]
| 1,123 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,o,r,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=o, Param5=r, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=o, Param5=r, Param6=n, ]
| 1,124 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,e,r,n,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=r, Param5=n, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=e, Param4=r, Param5=n, Param6=FreeVariable (variable) , ]
| 1,125 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,g,Var5,Var2,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=r, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=r, ]
| 1,126 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,g,a,m,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=a, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=a, Param5=m, Param6=e, ]
| 1,127 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,g,b,d,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=b, Param5=d, Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=b, Param5=d, Param6=h, ]
| 1,128 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,g,h,r,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=h, Param5=r, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=h, Param5=r, Param6=b, ]
| 1,129 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,g,n,Var1,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=n, Param5=FreeVariable (variable) , Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=n, Param5=FreeVariable (variable) , Param6=b, ]
| 1,130 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,g,o,r,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=o, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=o, Param5=r, Param6=FreeVariable (variable) , ]
| 1,131 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,g,t,r,a).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=t, Param5=r, Param6=a, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=g, Param4=t, Param5=r, Param6=a, ]
| 1,132 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,h,Var3,Var4,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=n, ]
| 1,133 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,h,Var4,n,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, Param4=FreeVariable (variable) , Param5=n, Param6=o, ]
| 1,134 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,h,d,Var5,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, Param4=d, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,135 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,h,l,t,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, Param4=l, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, Param4=l, Param5=t, Param6=FreeVariable (variable) , ]
| 1,136 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,h,o,l,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, Param4=o, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, Param4=o, Param5=l, Param6=FreeVariable (variable) , ]
| 1,137 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,h,r,o,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, Param4=r, Param5=o, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=h, Param4=r, Param5=o, Param6=b, ]
| 1,138 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,Var4,Var1,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=FreeVariable (variable) , 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=e, ]
| 1,139 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,Var4,Var5,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,140 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,Var4,d,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=FreeVariable (variable) , Param5=d, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=FreeVariable (variable) , Param5=d, Param6=FreeVariable (variable) , ]
| 1,141 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,d,b,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=d, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=d, Param5=b, Param6=n, ]
| 1,142 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,g,Var4,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=g, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=g, Param5=FreeVariable (variable) , Param6=o, ]
| 1,143 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,g,e,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=g, Param5=e, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=g, Param5=e, Param6=FreeVariable (variable) , ]
| 1,144 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,m,Var3,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=m, Param5=FreeVariable (variable) , Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=m, Param5=FreeVariable (variable) , Param6=h, ]
| 1,145 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,n,Var2,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=n, Param5=FreeVariable (variable) , Param6=d, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=n, Param5=FreeVariable (variable) , Param6=d, ]
| 1,146 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,n,Var4,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=n, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=n, Param5=FreeVariable (variable) , Param6=t, ]
| 1,147 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,l,t,g,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=t, Param5=g, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=l, Param4=t, Param5=g, Param6=r, ]
| 1,148 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,m,Var2,b,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=FreeVariable (variable) , 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=FreeVariable (variable) , Param5=b, Param6=l, ]
| 1,149 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,m,Var2,o,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=FreeVariable (variable) , Param5=o, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=FreeVariable (variable) , Param5=o, Param6=d, ]
| 1,150 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,m,Var4,t,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=FreeVariable (variable) , Param5=t, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=FreeVariable (variable) , Param5=t, Param6=r, ]
| 1,151 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,m,Var5,g,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=FreeVariable (variable) , Param5=g, Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=FreeVariable (variable) , Param5=g, Param6=h, ]
| 1,152 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,m,e,a,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=e, Param5=a, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=e, Param5=a, Param6=d, ]
| 1,153 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,m,h,Var5,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=h, Param5=FreeVariable (variable) , Param6=d, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=h, Param5=FreeVariable (variable) , Param6=d, ]
| 1,154 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,m,o,Var5,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=o, Param5=FreeVariable (variable) , Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=o, Param5=FreeVariable (variable) , Param6=b, ]
| 1,155 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,m,r,Var2,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=r, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=r, Param5=FreeVariable (variable) , Param6=e, ]
| 1,156 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,m,t,h,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=t, Param5=h, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=m, Param4=t, Param5=h, Param6=b, ]
| 1,157 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,Var3,g,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=FreeVariable (variable) , Param5=g, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=FreeVariable (variable) , Param5=g, Param6=d, ]
| 1,158 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,Var5,Var2,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,159 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,a,Var2,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=a, Param5=FreeVariable (variable) , Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=a, Param5=FreeVariable (variable) , Param6=h, ]
| 1,160 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,a,o,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=a, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=a, Param5=o, Param6=r, ]
| 1,161 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,b,d,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=b, Param5=d, Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=b, Param5=d, Param6=h, ]
| 1,162 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,b,h,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=b, Param5=h, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=b, Param5=h, Param6=FreeVariable (variable) , ]
| 1,163 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,b,r,Var2).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=b, Param5=r, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=b, Param5=r, Param6=FreeVariable (variable) , ]
| 1,164 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,d,Var3,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=d, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,165 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,h,l,o).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=h, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=h, Param5=l, Param6=o, ]
| 1,166 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,h,t,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=h, Param5=t, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=h, Param5=t, Param6=r, ]
| 1,167 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,m,a,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=m, Param5=a, Param6=g, ]
| 1,168 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,m,g,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=m, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=m, Param5=g, Param6=e, ]
| 1,169 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,n,t,o,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=t, Param5=o, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=n, Param4=t, Param5=o, Param6=b, ]
| 1,170 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,o,Var1,g,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=FreeVariable (variable) , Param5=g, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=FreeVariable (variable) , Param5=g, Param6=l, ]
| 1,171 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,o,Var2,n,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=FreeVariable (variable) , Param5=n, Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=FreeVariable (variable) , Param5=n, Param6=g, ]
| 1,172 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,o,Var2,r,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=FreeVariable (variable) , Param5=r, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=FreeVariable (variable) , Param5=r, Param6=FreeVariable (variable) , ]
| 1,173 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,o,Var5,Var4,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=g, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=g, ]
| 1,174 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,o,e,g,h).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=e, Param5=g, Param6=h, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=e, Param5=g, Param6=h, ]
| 1,175 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,o,g,Var5,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=g, Param5=FreeVariable (variable) , Param6=l, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=g, Param5=FreeVariable (variable) , Param6=l, ]
| 1,176 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,o,r,b,d).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=r, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=o, Param4=r, Param5=b, Param6=d, ]
| 1,177 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,r,Var4,h,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=r, Param4=FreeVariable (variable) , Param5=h, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=r, Param4=FreeVariable (variable) , Param5=h, Param6=FreeVariable (variable) , ]
| 1,178 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,r,b,n,Var3).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=r, Param4=b, Param5=n, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=r, Param4=b, Param5=n, Param6=FreeVariable (variable) , ]
| 1,179 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,t,Var4,d,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=FreeVariable (variable) , Param5=d, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=FreeVariable (variable) , Param5=d, Param6=n, ]
| 1,180 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,t,Var5,a,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=FreeVariable (variable) , Param5=a, Param6=e, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=FreeVariable (variable) , Param5=a, Param6=e, ]
| 1,181 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,t,a,e,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=a, Param5=e, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=a, Param5=e, Param6=FreeVariable (variable) , ]
| 1,182 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,t,b,e,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=b, Param5=e, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=b, Param5=e, Param6=g, ]
| 1,183 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,t,b,g,n).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=b, Param5=g, 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=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=b, Param5=g, Param6=n, ]
| 1,184 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,c,t,e,Var2,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=e, Param5=FreeVariable (variable) , Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=c, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=c, Param3=t, Param4=e, Param5=FreeVariable (variable) , Param6=b, ]
| 1,185 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var1,a,c,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=a, Param5=c, 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=a, Param5=c, Param6=t, ]
| 1,186 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var1,a,o,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=a, Param5=o, Param6=e, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=a, Param5=o, Param6=e, ]
| 1,187 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var1,b,Var3,Var5).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=b, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=b, Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , ]
| 1,188 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var1,c,r,b).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=c, Param5=r, Param6=b, ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=c, Param5=r, Param6=b, ]
| 1,189 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var1,m,Var5,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=m, 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=m, Param5=FreeVariable (variable) , Param6=g, ]
| 1,190 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var1,r,Var2,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=r, Param5=FreeVariable (variable) , Param6=g, ]
| 1,191 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var2,Var3,c,l).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=c, 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=c, Param6=l, ]
| 1,192 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var2,Var4,Var5,c).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=c, ]
| 1,193 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var2,Var5,o,Var1).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=o, Param6=FreeVariable (variable) , ]
CHECKING word : [Param1=FreeVariable (variable) , Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abalone (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=l (variable) , Param6=o (variable) , Param7=n (variable) , Param8=e (variable) , ]
CHECKING word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=o, Param6=FreeVariable (variable) , ]
| 1,194 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var2,Var5,t,e).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=t, 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=t, Param6=e, ]
| 1,195 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var2,h,Var4,r).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=h, 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=h, Param5=FreeVariable (variable) , Param6=r, ]
| 1,196 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var2,h,m,Var4).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=h, 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=h, Param5=m, Param6=FreeVariable (variable) , ]
| 1,197 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var2,h,r,t).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=h, 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=h, Param5=r, Param6=t, ]
| 1,198 |
|
26 |
% Ex. 1 - rebusul
word(abalone,a,b,a,l,o,n,e).
word(abandon,a,b,a,n,d,o,n).
word(anagram,a,n,a,g,r,a,m).
word(connect,c,o,n,n,e,c,t).
word(elegant,e,l,e,g,a,n,t).
word(enhance,e,n,h,a,n,c,e).
crossword(V1, V2, V3, H1, H2, H3) :-
word(V1, _, A, _, B, _, C, _),
word(V2, _, D, _, E, _, F, _),
word(V3, _, G, _, H, _, I, _),
word(H1, _, A, _, D, _, G, _),
word(H2, _, B, _, E, _, H, _),
word(H3, _, C, _, F, _, I, _).
% Ex. 2 - baza de date
born(jan, date(20,3,1977)).
born(jeroen, date(2,2,1992)).
born(joris, date(17,3,1995)).
born(jelle, date(1,1,2004)).
born(joan, date(24,12,0)).
born(joop, date(30,4,1989)).
born(jannecke, date(17,3,1993)).
born(jaap, date(16,11,1995)).
% date(Day, Month, Year)
% year/2, year(+Year, -Person).
year(Year,Person) :-
born(Person, date(_,_,Year)).
% before/2
before(date(D1,M1,Y1),date(D2,M2,Y2)):-
Y1 < Y2;
Y1 =:= Y2, M1 < M2;
Y1 =:= Y2, M1 =:= M2, D1 < D2.
% older/2
older(X,Y):-
born(X, DateX),
born(Y, DateY),
before(DateX, DateY).
% Ex. 3 - labirintul
% connected(1,2).
% connected(3,4).
% connected(5,6).
% connected(7,8).
% connected(9,10).
% connected(12,13).
% connected(13,14).
% connected(15,16).
% connected(17,18).
% connected(19,20).
% connected(4,1).
% connected(6,3).
% connected(4,7).
% connected(6,11).
% connected(14,9).
% connected(11,15).
% connected(16,12).
% connected(14,17).
% connected(16,19).
connected(1,2).
connected(2,1).
connected(1,3).
connected(3,4).
% path / 2, path(X,Y) - true daca exista un drum de la X la Y
path(X, Y) :-
connected(X,Y).
path(X, Y) :-
connected(X, Z),
path(Z, Y).
% Tema: solutia pentru a elimina ciclurile este sa avem o lista de noduri vizitate
% path(X, Y, Viz)
path1(X, Y, V) :- not(member(X, V)), connected(X,Z), path1(Z, Y, [X|V]).
% Ex. 4 - reprezentarea numerelor naturale ca liste
% 0 = [], 1 = [x], 2 = [x,x]
succesor(L, [x | L]).
plus(L1,L2, LR) :- append(L1,L2,LR).
times([], _, []).
times([x | T], L2, LR) :-
times(T, L2, ListTail),
plus(L2, ListTail, LR).
% Ex. 5 - al n-lea element intr-o lista
% element_at/3, element_at(+List, +Index, -ElemDePeIndex).
element_at([H|_], 0, H).
element_at([_|T], Index, Result):-
NewIndex is Index-1,
element_at(T, NewIndex, Result).
% Ex. 6 - mutantii
animal(alligator).
animal(tortue).
animal(caribou).
animal(ours).
animal(cheval).
animal(vache).
animal(lapin).
% mutant/1
% name/2 - transforma un sir de caratere intr-o lista cu codurile lor ASCII
mutant(X) :-
animal(Y),
animal(Z),
Y \= Z,
name(Y, Ly),
name(Z, Lz),
append(Y1, Y2, Ly),
append(Y2, _, Lz),
Y2 \= [],
append(Y1, Lz, Lx),
name(X, Lx).
% exista o factorizare a listei Ly Y1 ++ Y2 = Ly
% exista o factorizare a listei Lz Y2 ++ _ = Lz
| 0 |
crossword(Var0,d,Var2,r,a,g).
| false |
CHECKING crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=r, 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=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
FAILED word : [Param1=d, Param2=FreeVariable (variable) , Param3=FreeVariable (variable) , Param4=FreeVariable (variable) , Param5=FreeVariable (variable) , Param6=FreeVariable (variable) , Param7=FreeVariable (variable) , Param8=FreeVariable (variable) , ]
PASSED word : [Param1=abandon (variable) , Param2=a (variable) , Param3=b (variable) , Param4=a (variable) , Param5=n (variable) , Param6=d (variable) , Param7=o (variable) , Param8=n (variable) , ]
PASSED word : [Param1=anagram (variable) , Param2=a (variable) , Param3=n (variable) , Param4=a (variable) , Param5=g (variable) , Param6=r (variable) , Param7=a (variable) , Param8=m (variable) , ]
PASSED word : [Param1=connect (variable) , Param2=c (variable) , Param3=o (variable) , Param4=n (variable) , Param5=n (variable) , Param6=e (variable) , Param7=c (variable) , Param8=t (variable) , ]
PASSED word : [Param1=elegant (variable) , Param2=e (variable) , Param3=l (variable) , Param4=e (variable) , Param5=g (variable) , Param6=a (variable) , Param7=n (variable) , Param8=t (variable) , ]
PASSED word : [Param1=enhance (variable) , Param2=e (variable) , Param3=n (variable) , Param4=h (variable) , Param5=a (variable) , Param6=n (variable) , Param7=c (variable) , Param8=e (variable) , ]
FAILED crossword : [Param1=FreeVariable (variable) , Param2=d, Param3=FreeVariable (variable) , Param4=r, Param5=a, Param6=g, ]
| 1,199 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.