Programação com Restrições

Knowledge:

• Constraint Satisfaction Problems, and its combinatorial complexity.
• Discrete (finite and Boolean) and continuous domains. The special case of SAT.
• Constraint propagation and types of consistency.
• Algorithms for consistency maintenance.
• Heuristics.

Application:

• Problem modelling and solving.
• Selection of the most adequate constraints and algorithms.
• Choice of efficient heuristics.

Soft-skills:

• ****Understanding of informal specifications.
• Identification of the most adequate models.
• Abstraction and generalisation skills.
• Analysis and explanation of results.
• Specialised literature search