!
)parent(thomas, X), parent(X, Y)
parent(thomas, X), parent(X, Y), !
parent(thomas, X), !, parent(X, Y)
!, parent(thomas, X), parent(X, Y)
min/2
uporabimo rez, da se izognemo pogoju v drugi rekurzivni vejicount/3
not(P) :- P, !, fail ; true.
\+
not(female(xy))
\+ female(X), parent(thomas, X)
parent(thomas, X), \+ female(X)
union(A, B, U)
U
= A
∪ B
intersect(A, B, I)
I
= A
∩ B
diff(A, B, D)
D
= A
- B
is_superset/2
A
⊇ B
is_subset(A, B)
A
⊆ B
subset/2
powerset/2
findall/3