Prolog (Introduction)

Y=f(X1, ..., Xn)rf(X1, ..., Xn, Y )
X1, ..., XnY f(X1, ..., Xn)
A.
homme(martin).
B:−A1, ..., Am.1B A1· · · Am
pere(X, Y ) : −parent(X, Y ), homme(X).
A B nom(t1, ..., tn)nom
pere
X1 12· · ·
anne · · ·
:−A.1A.1
parent(X, martin).
∼
base.pl homme(martin). homme(jean).
femme(X). parent(X, pierre). etudiant(X, Y, Z, T ).
pere(X, Y )
mere(X, Y )neveu(X, Y )niece(X, Y )grandpere(X, Y )mamie(X, Y )ancetre(X, Y )
base.pl
[] e1,· · · , en[e1,· · · , en]
[e|L]e L
append(L1, L2, L3) L3L1L2member(e, L)
e L
efface(X, L, R)X L
R

[a, b] = [X, Y ].
[a] = [X|Y].
[a, b, c, d] = [X, Y |Z].
[a, b, c, d] = [X, Y, Z].
[[a, b, c], d] = [X|Y].
member(a, [b, c, a, d]).
member(a, [b, c, d, e]).
member(X, [a, b, c]).
append([a],[b, c],[a, b, c]).
append(L1, L2,[a, b, c]).
enum(X, I, J ) : −I=< J , X is I.
enum(X, I, J ) : −I=< J , K is I + 1 , enum(X, K, J).
label([], I, J).
label([X|L], I, J) : −enum(X, I, J), label(L, I, J).
ic
1N
N= 9
X= 1 + 1. X is 1+1.
=
s t s t
s t
is
fact(0,1).
fact(N, F ) : −N > 0, N1is N −1, f act(N1, F P ), F is N ∗F P.
long([],0).
long([X|L], N) : −long(L, N 1), N =N1+1.
gcd(N, 0, N ).
gcd(I, J, G) : −J > 0, R is I mod J, gcd(J, R, G).