Eventos

Palestrante

Prof. Jeffrey Van Baalen1

Practical Constraint Programming

27 de junho de 2012, 4ª feira, às 16:00 h

UERJ �€“ Maracanã, Pavilhão Reitor João Lyra Filho

Bloco F, 6º andar, auditório Maria Luiza Corrêa (RAV 62)

Abstract: Constraint satisfaction problems are a large class of problems that have been well studied in Artificial Intelligence. Constraint programming techniques have proven to have wide applicability in theory and with the recent public availability of efficient constraint programming libraries, it has become commercially feasible to develop applications that employ constraint programming.

This talk will begin with a brief introduction and definition of constraint satisfaction problems. It will illustrate the use of a publically available constraint programming library written in JAVA. We will introduce the concepts in the library using the well-known N-Queens problem and then discuss how we used the library to develop a commercial rostering application.

The application enables automatic generation of complex man-power rosters, such as those used by hospitals, from a set of user-defined constraints that the rosters must satisfy (or optimize). We will show how the library allows the combination of constraint satisfaction and optimization to produce solutions that, first, satisfy a set of hard constraints and, second, optimize a set of soft constraints.