%
% Clique decision
%

int: n;
array[1..n,1..n] of 0..1: A; % adjacency
int: k;

% declare constrained integer variables
array[1..n] of var 0..1: v; % v[i] = 1 <-> ith vertex is in the clique

% declare constraints
constraint forall(i,j in 1..n where i<j)(A[i,j] = 0 -> v[i] + v[j] < 2);
constraint sum(v) >= k;

solve satisfy;