|
- Constraint
satisfaction in a nutshell
- domain
filtering and local consistencies
- arc
and path consistency
- global
constraints
- search
techniques
- systematic
search
-
branching schemes
- discrepancy
search
- extensions
of a basic constraint satisfaction problem
- constraint
optimization
- soft
constraints
- dynamic
problems
- Constraints
for planning and scheduling
- constraints
in planning
- compiling
planning graph into a CSP
-
temporal
reasoning
- constraints
in scheduling
- basic
model
- resource
constraints (edge-finding,
aggregated demands, …)
- branching
schemes (slack-based
heuristics, shaving, …)
- Conclusions
- a
short survey on constraint solvers
- summary,
Q & A
|