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 023 (Magic hexagon) — Constraint detection
A
magic
hexagon
consists
of
the
number
1
to
19
arranged
in
a
hexagonal
pattern
:
A
,
B
,
C
D
,
E
,
F
,
G
H
,
I
,
J
,
K
,
L
M
,
N
,
O
,
P
Q
,
R
,
S
.
We
have
a
constraint
that
all
diagonals
sum
to
38
.
That
is
,
A+B+C
=
D+E+F+G
=
...
=
Q+R+S
=
38
,
A+D+H
=
B+E+I+M
=
...
=
L+P+S
=
38
,
C+G+L
=
B+F+K+P
=
...
=
H+M+Q
=
38
.
Problem 023 (Magic hexagon) — Detection of the decisions and objects to be modeled
A
magic
hexagon
consists
of
the
number
1
to
19
arranged
in
a
hexagonal
pattern
:
A
,
B
,
C
D
,
E
,
F
,
G
H
,
I
,
J
,
K
,
L
M
,
N
,
O
,
P
Q
,
R
,
S
.
We
have
a
constraint
that
all
diagonals
sum
to
38
.
That
is
,
A+B+C
=
D+E+F+G
=
...
=
Q+R+S
=
38
,
A+D+H
=
B+E+I+M
=
...
=
L+P+S
=
38
,
C+G+L
=
B+F+K+P
=
...
=
H+M+Q
=
38
.
Back to list