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 123 (Milk Collection) — Constraint detection
A
small
milk
processing
company
is
committed
to
collecting
milk
from
20
farms
and
taking
it
back
to
the
depot
for
processing
.
The
company
has
one
tanker
lorry
with
a
capacity
for
carrying
80000
litres
of
milk
.
Eleven
of
the
farms
are
small
and
need
a
collection
only
every
other
day
.
The
other
nine
farms
need
a
collection
every
day
.
The
positions
of
the
farms
in
relation
to
the
depot
-LRB-
numbered
1
-RRB-
are
given
in
a
table
together
with
their
collection
requirements
.
Find
the
optimal
route
for
the
tanker
lorry
on
each
day
,
bearing
in
mind
that
it
has
to
-LRB-
i
-RRB-
visit
all
the
``
every
day
''
farms
,
-LRB-
ii
-RRB-
visit
some
of
the
``
every
other
day
''
farms
and
-LRB-
iii
-RRB-
work
within
its
capacity
.
On
alternate
days
,
it
must
again
visit
the
``
every
day
''
farms
and
also
visit
the
``
every
other
day
''
farms
not
visited
on
the
previous
day
.
For
convenience
,
a
map
of
the
area
considered
is
given
in
a
figure
.
Problem 123 (Milk Collection) — Detection of the decisions and objects to be modeled
A
small
milk
processing
company
is
committed
to
collecting
milk
from
20
farms
and
taking
it
back
to
the
depot
for
processing
.
The
company
has
one
tanker
lorry
with
a
capacity
for
carrying
80000
litres
of
milk
.
Eleven
of
the
farms
are
small
and
need
a
collection
only
every
other
day
.
The
other
nine
farms
need
a
collection
every
day
.
The
positions
of
the
farms
in
relation
to
the
depot
-LRB-
numbered
1
-RRB-
are
given
in
a
table
together
with
their
collection
requirements
.
Find
the
optimal
route
for
the
tanker
lorry
on
each
day
,
bearing
in
mind
that
it
has
to
-LRB-
i
-RRB-
visit
all
the
``
every
day
''
farms
,
-LRB-
ii
-RRB-
visit
some
of
the
``
every
other
day
''
farms
and
-LRB-
iii
-RRB-
work
within
its
capacity
.
On
alternate
days
,
it
must
again
visit
the
``
every
day
''
farms
and
also
visit
the
``
every
other
day
''
farms
not
visited
on
the
previous
day
.
For
convenience
,
a
map
of
the
area
considered
is
given
in
a
figure
.
Back to list