NLP for CP
Addressing Constraint Programming with Natural Language Processing
Home
Resources
Publications
Correct
predictions are in
blue
. If we detect only a subset of a labelled sentence, we highlight the caught part as
blue
, the missing part
light blue.
False positives
are in
green
and
false negatives
are in
red
.
Problem 019_Sequence (Magic sequence) — Constraint detection
A
magic
sequence
of
length
n
is
a
sequence
of
integers
$
x_0
,
...
,
x
_
-LCB-
n-1
-RCB-
$
between
$
0
$
and
$
n-1
$
,
such
that
for
all
$
i
$
in
$
0
$
to
$
n-1
$
,
the
number
i
occurs
exactly
$
x_i
$
times
in
the
sequence
.
For
instance
,
$
6,2,1,0,0,0,1,0,0,0
$
is
a
magic
sequence
since
$
0
$
occurs
$
6
$
times
in
it
,
$
1
$
occurs
twice
,
etc.
.
Problem 019_Sequence (Magic sequence) — Detection of the decisions and objects to be modeled
A
magic
sequence
of
length
n
is
a
sequence
of
integers
$
x_0
,
...
,
x
_
-LCB-
n-1
-RCB-
$
between
$
0
$
and
$
n-1
$
,
such
that
for
all
$
i
$
in
$
0
$
to
$
n-1
$
,
the
number
i
occurs
exactly
$
x_i
$
times
in
the
sequence
.
For
instance
,
$
6,2,1,0,0,0,1,0,0,0
$
is
a
magic
sequence
since
$
0
$
occurs
$
6
$
times
in
it
,
$
1
$
occurs
twice
,
etc.
.
Back to list