satisfying
existing reservations
opening times
available tables
Slide 11
Slide 11 text
satisfying
the size of the group
existing reservations
opening times
available tables
tests
Slide 12
Slide 12 text
satisfying
the size of the group
existing reservations
opening times
available tables
business rule #1
tests
Slide 13
Slide 13 text
satisfying
the size of the group
existing reservations
opening times
available tables
business rule #1
business rule #2
release dates
tests
Slide 14
Slide 14 text
satisfying
the size of the group
existing reservations
opening times
available tables
business rule #1
business rule #2
business rule #3
release dates
tests
Slide 15
Slide 15 text
satisfying
the size of the group
existing reservations
opening times
available tables
business rule #1
business rule #2
business rule #3
release dates
tests
which ones?
Slide 16
Slide 16 text
satisfying
the size of the group
existing reservations
opening times
available tables
business rule #137812
business rule #1
business rule #2
business rule #3
release dates
tests
which ones?
Slide 17
Slide 17 text
No content
Slide 18
Slide 18 text
No content
Slide 19
Slide 19 text
Late night problem googling
Slide 20
Slide 20 text
‘Managing Restaurant Tables
Using Constraint Programming’
Slide 21
Slide 21 text
‘Managing Restaurant Tables
Using Constraint Programming’
Slide 22
Slide 22 text
Thank you, Alfio Vidotto
Slide 23
Slide 23 text
Thank you, Alfio Vidotto
Slide 24
Slide 24 text
Lets define by example
Slide 25
Slide 25 text
No content
Slide 26
Slide 26 text
/kənˈstreɪnt/
A constraint is a logical relation
among several variables,
each taking a value in a given domain.
Slide 27
Slide 27 text
several variables
Slide 28
Slide 28 text
domain
Slide 29
Slide 29 text
logical relation
Slide 30
Slide 30 text
Easier done than said.
Slide 31
Slide 31 text
No content
Slide 32
Slide 32 text
Simple Backtracking in Ruby
Slide 33
Slide 33 text
meet call/cc
Slide 34
Slide 34 text
Simple Backtracking in Ruby
Slide 35
Slide 35 text
Thank you, Jim Weirich
Slide 36
Slide 36 text
Thank you, Jim Weirich
Slide 37
Slide 37 text
No content
Slide 38
Slide 38 text
First research on constraint
satisfaction problems
dates back to the 70s
Slide 39
Slide 39 text
Montanary 1974
Waltz 1975
Slide 40
Slide 40 text
Systematic use of constraints
described in
‘Constraint logic programming’
Jaffar, Lassez 1987*
Slide 41
Slide 41 text
30 years
Slide 42
Slide 42 text
areas of
research
search
generate and
test
back tracking back jumping back marking
consistency
node
consistency
arc consistency path consistency
constraint
propagation
forward
checking
look ahead
reducing search
constraint
optimisation
constraint satisfaction landscape
Slide 43
Slide 43 text
use constraint programming
Slide 44
Slide 44 text
use constraint programming
Slide 45
Slide 45 text
use constraint programming
for scheduling, planning
Slide 46
Slide 46 text
use constraint programming
Slide 47
Slide 47 text
use constraint programming
Slide 48
Slide 48 text
use constraint programming
for resource allocation*
Slide 49
Slide 49 text
use constraint programming
Slide 50
Slide 50 text
Main advantages
Slide 51
Slide 51 text
Model programs
closely to their real world
entities.
Slide 52
Slide 52 text
Vast open research
in optimising
difficult problem areas.
Slide 53
Slide 53 text
Clever modelling can get
you around NP-hard
problems.
*satisfaction not guaranteed
Slide 54
Slide 54 text
Interested in more?
Slide 55
Slide 55 text
Upcoming events
• ACP Summer Schools
http://www.a4cp.org/events/summer-schools
• CP Conference Series
http://www.a4cp.org/events/cp-conference-series
August 28th to September 1st 2017, Melbourne, Australia