%
% Maximum Clique (MC)
%

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

% 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)(if A[i,j] = 0 then v[i] + v[j] < 2 else true endif);

var 1..n: cliqueNumber; % number of vertices in the clique
constraint cliqueNumber = sum(v);

solve maximize cliqueNumber;