CFP: Soft-2003 - WS on Soft Constraints
Stefano Bistarelli
stefano.bistarelli@iit.cnr.it
Tue, 10 Jun 2003 19:52:03 +0200
This is a multi-part message in MIME format.
--Boundary_(ID_4bR4Fa2T7y8l8Dqvy1mRLw)
Content-type: text/plain; charset="iso-8859-1"
Content-transfer-encoding: quoted-printable
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D
=3D=3D=3D=3D=3D=3D=3D
5th International Workshop on
Soft Constraints
Held in conjunction with
9th International Conference on
Principles and Practice of Constraint Programming, CP2003
Actons Hotel, Kinsale, County Cork, Ireland.
29 September - 3 October, 2003
http://www.sci.unich.it/~bista/organizing/soft-2003/
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D
=3D=3D=3D=3D=3D=3D=3D=3D
Call for Paper
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D
=3D=3D=3D=3D=3D=3D=3D=3D
Soft-constraints augment the classical CSP framework by allowing the
user to express preferences among potential solutions. Given a
well-defined mechanism to express and combine preferences, the goal is
to find the "best" solution. Therefore, solving soft constraints becomes
an optimization task, harder than the satisfaction tasks in classical
CSP. Sometimes optimization becomes multi-objective, making the solving
process even more complex. The interest of the community on soft
constraints has increased in the last years. Several theoretical
frameworks have been developed to allow soft constraints in problem
modeling. For these frameworks, new algorithms have been built. The main
motivation for this line of research is the existence of many real
problems involving preferences among potential solutions, which demand
an effective solving method.
Also in this edition, we want to enlarge the workshop scope by
encouraging submissions from domains where soft constraints have
specific semantics such as propositional logic formulae (i.e. MAX-SAT),
probability distributions (i.e. probabilistic reasoning) or uncertainty.
Workshop topics include (but are not limited to):
1. theoretical frameworks for soft constraints
2. problem modeling with soft constraints
3. solving algorithms for soft constraints
4. interlacing satisfaction and optimization techniques
5. multi-objective optimization and soft constraints
6. constraint languages including soft constraints
7. combining/integrating soft constraint frameworks and algorithms =
into
the Constraint Programming framework
8. comparative studies
9. real-life applications
Delivery & Submissions
This workshop is intended to build on the experience and success of the
CP99, CP2000, CP2001 and CP2002 workshops on the same subject, and its =
aim
is to provide a forum where researchers currently working in this area =
can
discuss their most recent ideas and developments and think together =
about
the most promising new directions.
Therefore we encourage the presentation of work in progress or on
specialized aspects of soft constraints. Papers that bridge the gap =
between
theory and practice are especially welcome.
Prospective attendees can Submit a paper, which can be up to 15 pages in
length.
We encourage authors to submit papers electronically in postscript or =
pdf
format. Papers should be formatted using the Lecture Notes in Computer
Science (LNCS) style.
Please send your submissions by email to larrosa@lsi.upc.es using the
subject line Soft-2003 Workshop Submission.
Important Dates
The proposed schedule of important dates for the workshop is as follows:
Paper Submission deadline June 24th
Notification of acceptance July 24th
Camera-ready version deadline August 14th
Workshop Date September 29th
Workshop Organizers:
Stefano Bistarelli
Istituto per l'Informatica e la Telematica, C.N.R., Pisa, Italy
Stefano.Bistarelli@iit.cnr.it
Dipartimento di Scienze, Universita' degli Studi "G. D'Annunzio",
Pescara, Italy
bista@sci.unich.it
Javier Larrosa
Universitat Polit=E8cnica de Catalunya, Barcelona, Spain
larrosa@lsi.upc.es
Thomas Schiex
Institut National de La Recherche Agronomique, Castanet Tolosan Cedex =
-
France
tschiex@toulouse.inra.fr
Program Committee:
Fadi Aloul (Electrical Engineering & Computer Science University of =
Michigan
- Ann Arbor, USA)
H=E9l=E8ne Fargier (IRIT, Universit=E9 Paul Sabatier, France)
Thom Fruehwirth (University of Ulm, Germany)
Carmen Gervet (IC-Parc, Imperial College, UK)
Ulrich Junker (ILOG, France)
Jimmy H. M. Lee (The Chinese University of Hong Kong, Hong Kong)
Pedro Meseguer (IIIA-CSIC, Bellaterra, Spain)
Barry O'Sullivan (University College Cork, Ireland)
Francesca Rossi (University of Padova, Italy)
--Boundary_(ID_4bR4Fa2T7y8l8Dqvy1mRLw)
Content-type: text/html; charset="iso-8859-1"
Content-transfer-encoding: quoted-printable
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=3DContent-Type content=3D"text/html; =
charset=3Diso-8859-1">
<META content=3D"MSHTML 6.00.2726.2500" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3DArial size=3D2><FONT face=3D"Times New Roman"=20
size=3D3>=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D<BR>=3D=3D=3D=3D=3D=3D=3D<BR> &n=
bsp; =20
5th International Workshop=20
on<BR> Soft=20
Constraints<BR> Held in conjunction=20
with<BR> 9th International Conference on<BR> =
Principles=20
and Practice of Constraint Programming, CP2003<BR> Actons Hotel, =
Kinsale,=20
County Cork, Ireland.<BR> 29 September - 3 October,=20
2003<BR><BR> </FONT><A=20
href=3D"http://www.sci.unich.it/~bista/organizing/soft-2003/"><FONT=20
face=3D"Times New Roman"=20
size=3D3>http://www.sci.unich.it/~bista/organizing/soft-2003/</FONT></A><=
BR><BR><FONT=20
face=3D"Times New Roman"=20
size=3D3>=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D<BR>=3D=3D=3D=3D=3D=3D=3D=3D<BR>  =
; =
=
Call for=20
Paper<BR>=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D<BR>=3D=3D=3D=3D=3D=3D=3D=3D<BR><BR><BR>Soft-constraints=20
augment the classical CSP framework by allowing the<BR>user to express=20
preferences among potential solutions. Given a<BR>well-defined mechanism =
to=20
express and combine preferences, the goal is<BR>to find the "best" =
solution.=20
Therefore, solving soft constraints becomes<BR>an optimization task, =
harder than=20
the satisfaction tasks in classical<BR>CSP. Sometimes optimization =
becomes=20
multi-objective, making the solving<BR>process even more complex. The =
interest=20
of the community on soft<BR>constraints has increased in the last years. =
Several=20
theoretical<BR>frameworks have been developed to allow soft constraints =
in=20
problem<BR>modeling. For these frameworks, new algorithms have been =
built. The=20
main<BR>motivation for this line of research is the existence of many=20
real<BR>problems involving preferences among potential solutions, which=20
demand<BR>an effective solving method.<BR><BR>Also in this edition, we =
want to=20
enlarge the workshop scope by<BR>encouraging submissions from domains =
where soft=20
constraints have<BR>specific semantics such as propositional logic =
formulae=20
(i.e. MAX-SAT),<BR>probability distributions (i.e. probabilistic =
reasoning) or=20
uncertainty.<BR><BR><BR>Workshop topics include (but are not limited=20
to):<BR><BR> 1. theoretical frameworks for soft=20
constraints<BR> 2. problem modeling with soft=20
constraints<BR> 3. solving algorithms for soft=20
constraints<BR> 4. interlacing satisfaction and=20
optimization techniques<BR> 5. multi-objective=20
optimization and soft constraints<BR> 6. =
constraint=20
languages including soft constraints<BR> 7.=20
combining/integrating soft constraint frameworks and algorithms=20
into<BR> the Constraint =
Programming=20
framework<BR> 8. comparative=20
studies<BR> 9. real-life=20
applications<BR><BR><BR>Delivery & Submissions<BR>This workshop is =
intended=20
to build on the experience and success of the<BR>CP99, CP2000, CP2001 =
and CP2002=20
workshops on the same subject, and its aim<BR>is to provide a forum =
where=20
researchers currently working in this area can<BR>discuss their most =
recent=20
ideas and developments and think together about<BR>the most promising =
new=20
directions.<BR>Therefore we encourage the presentation of work in =
progress or=20
on<BR>specialized aspects of soft constraints. Papers that bridge the =
gap=20
between<BR>theory and practice are especially =
welcome.<BR><BR>Prospective=20
attendees can Submit a paper, which can be up to 15 pages=20
in<BR>length.<BR><BR>We encourage authors to submit papers =
electronically in=20
postscript or pdf<BR>format. Papers should be formatted using the =
Lecture Notes=20
in Computer<BR>Science (LNCS) style.<BR><BR>Please send your submissions =
by=20
email to </FONT><A href=3D"mailto:larrosa@lsi.upc.es"><FONT =
face=3D"Times New Roman"=20
size=3D3>larrosa@lsi.upc.es</FONT></A><FONT face=3D"Times New Roman" =
size=3D3> using=20
the<BR>subject line Soft-2003 Workshop Submission.<BR><BR><BR>Important=20
Dates<BR>The proposed schedule of important dates for the workshop is as =
follows:<BR><BR>Paper Submission deadline June 24th<BR>Notification of=20
acceptance July 24th<BR>Camera-ready version deadline August =
14th<BR>Workshop=20
Date September 29th<BR><BR><BR>Workshop Organizers:<BR><BR> =
Stefano=20
Bistarelli<BR> Istituto per l'Informatica e la Telematica, =
C.N.R.,=20
Pisa, Italy<BR> </FONT><A=20
href=3D"mailto:Stefano.Bistarelli@iit.cnr.it"><FONT face=3D"Times New =
Roman"=20
size=3D3>Stefano.Bistarelli@iit.cnr.it</FONT></A><BR><FONT face=3D"Times =
New Roman"=20
size=3D3> Dipartimento di Scienze, Universita' degli Studi =
"G.=20
D'Annunzio",<BR>Pescara, Italy<BR> </FONT><A=20
href=3D"mailto:bista@sci.unich.it"><FONT face=3D"Times New Roman"=20
size=3D3>bista@sci.unich.it</FONT></A><BR><BR><FONT face=3D"Times New =
Roman"=20
size=3D3> Javier Larrosa<BR> Universitat =
Polit=E8cnica de=20
Catalunya, Barcelona, Spain<BR> </FONT><A=20
href=3D"mailto:larrosa@lsi.upc.es"><FONT face=3D"Times New Roman"=20
size=3D3>larrosa@lsi.upc.es</FONT></A><BR><BR><FONT face=3D"Times New =
Roman"=20
size=3D3> Thomas Schiex<BR> Institut National de =
La=20
Recherche Agronomique, Castanet Tolosan Cedex =
-<BR>France<BR> =20
</FONT><A href=3D"mailto:tschiex@toulouse.inra.fr"><FONT face=3D"Times =
New Roman"=20
size=3D3>tschiex@toulouse.inra.fr</FONT></A><BR><BR><BR><FONT=20
face=3D"Times New Roman" size=3D3>Program Committee:<BR><BR>Fadi Aloul =
(Electrical=20
Engineering & Computer Science University of Michigan<BR>- Ann =
Arbor,=20
USA)<BR>H=E9l=E8ne Fargier (IRIT, Universit=E9 Paul Sabatier, =
France)<BR>Thom=20
Fruehwirth (University of Ulm, Germany)<BR>Carmen Gervet (IC-Parc, =
Imperial=20
College, UK)<BR>Ulrich Junker (ILOG, France)<BR>Jimmy H. M. Lee (The =
Chinese=20
University of Hong Kong, Hong Kong)<BR>Pedro Meseguer (IIIA-CSIC, =
Bellaterra,=20
Spain)<BR>Barry O'Sullivan (University College Cork, =
Ireland)<BR>Francesca Rossi=20
(University of Padova, Italy)</FONT><BR></FONT></DIV></BODY></HTML>
--Boundary_(ID_4bR4Fa2T7y8l8Dqvy1mRLw)--