CP99 Post-Conference Workshop on

MODELLING AND SOLVING SOFT CONSTRAINTS

October 16, 1999

Alexandria, Virginia, USA

www.math.unipd.it/~frossi/cp99-soft/

Content:


Description of the workshop:

In the last 5-10 years, a lot of effort has been devoted to extending the classical notion of constraint, whose truth value is computed in a boolean (true/false) algebra, to be able to model features like fuzziness, uncertainty, optimization, probability, and partial satisfaction. Soft constraints are meant to satisfy this need, by associating to each tuple, or to each constraint, an element from a set, to be interpreted as a cost, or a level of preference, or a probability, or other.

This workshop will cover all topics related to soft constraints, with particular enphasis on modelling tools and solving algorithms. More in detail, the workshop will certainly deal with the following issues:

The aim of this workshop is to discuss about preliminary work or novel ideas about soft constraints in a less formal way than a conference. Therefore we encourage the presentation of work in progress or on specialized aspects of soft constraints. Theoretical papers, as well as papers that bridge the gap between theory and practice, are also welcome.

The workshop is held in conjunction with the Fifth International Conference on Principles and Practice of Constraint Programming (CP99), which will take place in Alexandria, Virginia, USA, on October 11-15, 1999. More details about the conference can be found at the URL http://www.ise.gmu.edu/cp99 .


Program of the workshop:

8:45-9:00 Opening notes
9:00-10:00 Invited Talk:
Managing Ill-Defined Components in Real World Constraint Problems
Carmen Gervet, IC-PARC, UK
10:00-10:30 Coffee break
10:30-12:00 Three presentations:
Fuzzy constraint satisfaction
R. E. Young, NCSU, USA
Fuzzy Hierarchies
F. Boussemart, C. Lecoutre, S. Merchez, E. Gregoire, Universite' d'Artois, France
Representing and Coping with recurrent Change in Dynamic Constraint Satisfaction Problems
R. J. Wallace, E. C. Freuder, Univ. of New Hampshire, USA
12:00-14:00 Lunch
14:00-15:00 Two presentations
Constraint satisfaction using soft quantifiers
R. R. Yager, Iona College, NY, USA
Uniform Framework for Solving Over-Constrained and Optimization Problems
H. Rudova, L. Matyska, Masaryk Univ., Czech Republic
15:00-15:30 Coffee break
15:30-16:30 Two presentations
Abstracting soft constraints
S. Bistarelli, Univ. of Pisa, Italy, P. Codognet, Univ. of Paris VI, France, Y. Georget, INRIA-Roquencourt, France, F. Rossi, Univ. of Padova, Italy
Soft constraints for music scheduling
F. Pachet, Sony CSL Paris, France
16:30-17:00 Closing notes

Paper Submissions:

Authors willing to present their work are invited to submit a paper by August 30, 1999. Authors will be notified of the acceptance or rejection of their papers by September 10, 1999.

Papers must not exceed 10 pages . The title page should include the name, address, telephone number, and electronic mailing address for each author, as well as a list of keywords. A contact author should also be provided. Electronic submission in PostScript format, to the address cp99-soft@math.unipd.it, is mandatory, unless special cases occur (to be notified to and agreed aupon with the organizers).

At least one of the authors for each accepted paper is expected to attend the meeting and present the work. The papers will be made available electronically at the workshop web page.


Organizers:


Francesca Rossi ( frossi@math.unipd.it)