From nzhou@acm.org Fri May 13 16:25:56 2005 From: nzhou@acm.org (Neng-Fa Zhou) Date: Fri, 13 May 2005 08:25:56 -0700 Subject: [bp-users]CFP: BeyondFD 2005 Message-ID: <004501c557d0$0fc37910$d2f9f592@toshibauser> This is a multi-part message in MIME format. ------=_NextPart_000_0042_01C55795.629EE010 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Call For Papers 1st International Workshop on=20 Constraint Programming Beyond Finite Integer Domains (BeyondFD 2005) http://centria.di.fct.unl.pt/conferences/BeyondFD05 To be held in conjunction with=20 International Conference on=20 Principles and Practice of Constraint Programming October 1st, 2005 Sitges, Spain Workshop Description =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D This workshop focuses on constraint programming over countable structured domains such as sets, multisets, sequences, lists, or others that go beyond traditional finite domains (namely over integers or other simple terms). The workshop aims at covering issues regarding such domains, mainly including (but not limited to): - Domain representation - Consistency techniques - Theoretical frameworks - Novel CSP models - Propagation algorithms - Integration and hybridisation of solvers - Implementation - Applications The objective is to promote discussion and presentation of novel ideas relating to systems and applications built upon such constraint domains. This will be achieved by presentations of current work both in terms of language and application developments. Workshop Motivation =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Since the Alice language, developed by Lauriere in the 70s, much research has been devoted and many constraint systems built upon sets and its extensions. The applicability of such systems has been demonstrated in areas as diverse as theorem proving, software prototyping, combinatorial design problems, circuit and network design, as well as sport tournament scheduling. Most of these problems involve a natural set-based setting and encompass many symmetries. Recent advances have shown challenging results that improve=20 the effectiveness of set-based models, e.g. new global=20 constraints, integration of different solvers, evaluation=20 of new data structures. Multiset constraints are a natural extension allowing an easier modeling of some problems such=20 as template design. The current successes and potentials of such constraint domains aim at combining natural modeling with effective=20 solving. The CP 2004 conference held in Toronto was prolific in this regard. Workshop Format =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D This workshop is open to all members of the CP and ICLP communities. The workshop will emphasize discussion and cross-fertilization,=20 so presentations will be balanced with discussion time.=20 In this direction, the workshop is seeking high quality papers that address cutting-edge research in this field, and that can contribute to the discussion. The agenda will include paper presentations, and possibly an invited speaker. At least one author of each accepted submission must attend the=20 workshop, and all participants must pay the workshop fee (which covers both CP'05 and ICLP'05 workshops). Important Dates =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Submission Deadline: June 30th Notifications to Authors: July 22nd Final Version Deadline: August 15th BeyondFD 2005 Workshop: October 1st Submission Guidelines =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Participants should submit a paper (maximum 15 pages, PDF=20 format), describing their work in topics relevant to the=20 workshop. Accepted papers will be presented during the workshop. At=20 least one author of an accepted contribution is expected to register for the workshop, and present the paper. All submissions should include the author's name(s),=20 affiliation, complete mailing address, and email address. Authors are requested to prepare their submissions, following=20 the LNCS/LNAI Springer format. Please see: http://www.springer.de/comp/lncs/authors.html=20 for further details.=20 The submission should be sent via email, in PDF format, to Francisco Azevedo (fa@di.fct.unl.pt) The deadline for receipt of submissions is June 30, 2005.=20 Papers received after this date may not be reviewed. Eligible papers will be peer-reviewed by at least three members of the Program Committee. Authors will be notified via email of the results by July 22, 2005. Authors of accepted papers are expected to improve their paper based on reviewers' comments and to send a camera ready version of their manuscripts by August 15, 2005. Accepted papers will be included in the workshop proceedings, which will be distributed to the participants. Questions about submissions may be directed to=20 fa@di.fct.unl.pt. Organizing Committee =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Francisco Azevedo (Universidade Nova de Lisboa) Carmen Gervet (IC-Parc) Enrico Pontelli (New Mexico State University) Program Committee =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Pedro Barahona (Universidade Nova de Lisboa) Pascal Brisset (ENAC) Agostino Dovier (University of Udine) Zeynep Kiziltan (University of Bologna) Joao Marques-Silva (Universidade Tecnica de Lisboa) Enrico Pontelli (New Mexico State University) Jean-Francois Puget (ILOG) Jean-Charles Regin (ILOG) Andrew Sadler (IC-Parc) Toby Walsh (University of New South Wales) Contact Information =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Francisco Azevedo, CENTRIA, FCT/UNL Departamento de Informatica Quinta da Torre 2829-516 Caparica Portugal fa@di.fct.unl.pt ------=_NextPart_000_0042_01C55795.629EE010 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
          &nbs= p;        =20 Call For=20 Papers
          &nb= sp; 1st=20 International Workshop on
  Constraint Programming Beyond = Finite=20 Integer=20 Domains
          &n= bsp;        =20 (BeyondFD 2005)
  http://centria.di.fct.unl.pt/conferences/BeyondFD05
          &nbs= p; =20 To be held in conjunction with=20
           &nb= sp; =20 International Conference on
     Principles and = Practice=20 of Constraint=20 Programming
         &nbs= p;        =20 October 1st,=20 2005
           = ;         =20 Sitges, Spain



Workshop=20 Description
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
  This workshop focuses on=20 constraint programming over countable
  structured domains such = as sets,=20 multisets, sequences,  lists,
  or others  that go = beyond=20 traditional  finite domains  (namely
  over integers = or other=20 simple terms).

  The workshop aims at  covering = issues =20 regarding such domains,
  mainly including (but not limited=20 to):
    - Domain representation
    = -=20 Consistency techniques
    - Theoretical=20 frameworks
    - Novel CSP = models
    -=20 Propagation algorithms
    - Integration and = hybridisation of=20 solvers
    - Implementation
    -=20 Applications

  The objective  is to promote  = discussion=20 and  presentation  of
  novel ideas  relating = to =20 systems and applications  built upon
  such  =20 constraint   domains.    This   = will =20 be  achieved   by
  presentations  of = current=20 work  both in terms of language  and
  application=20 developments.

Workshop = Motivation
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D =20 Since  the Alice language,  developed by Lauriere  in the = 70s,
  much research  has been devoted  and  = many =20 constraint systems
  built upon sets and its extensions.  = The=20 applicability of such
  systems  has been = demonstrated  in=20 areas as diverse as theorem
  proving,  software = prototyping,=20 combinatorial design problems,
  circuit  and  = network =20 design,  as  well  as  sport tournament
 =20 scheduling. Most of these problems involve a natural set-based
  = setting=20 and encompass many symmetries.

  Recent advances  have=20 shown  challenging results  that improve
  the =20 effectiveness  of  set-based  models,   = e.g. =20 new  global
  constraints,  integration  = of =20 different  solvers,  evaluation
  of  new  = data=20 structures.  Multiset constraints  are a natural
 =20 extension  allowing an easier modeling  of some problems  = such=20
  as template design.

  The  current =20 successes  and  potentials  of  such =20 constraint
  domains  aim  at  combining  = natural=20 modeling  with  effective
  solving.  The CP = 2004=20 conference  held in Toronto was prolific
  in this=20 regard.


Workshop = Format
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
This =20 workshop  is open  to  all members  of  = the =20 CP  and  ICLP
communities.
The workshop will = emphasize =20 discussion and cross-fertilization,
so presentations will be = balanced with=20 discussion time.
In this direction,  the workshop is = seeking  high=20 quality papers
that address  cutting-edge research in this = field, =20 and that can
contribute to the discussion.
The agenda  will=20 include  paper presentations,  and possibly  = an
invited=20 speaker.
At least one author of each accepted submission  must = attend=20 the
workshop,  and  all  participants  = must =20 pay  the  workshop  fee
(which covers both CP'05 and = ICLP'05=20 workshops).


Important = Dates
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
  =20 Submission Deadline:       June=20 30th
   Notifications to Authors:  July = 22nd
  =20 Final Version Deadline:    August 15th
   = BeyondFD=20 2005 Workshop:    October 1st

Submission=20 Guidelines
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D
   Participants =20 should  submit a paper  (maximum 15 pages,  PDF =
  =20 format),  describing  their work  in topics  = relevant =20 to the
   workshop.
   Accepted papers  = will be=20 presented  during the workshop.   At
   = least one=20 author  of an accepted contribution  is expected = to
  =20 register for the workshop, and present the paper.

   = All =20 submissions   should   include   the  = author's  name(s),
   affiliation, complete mailing = address,=20 and email address.

   Authors are requested to prepare = their=20 submissions, following
   the LNCS/LNAI Springer format. = Please=20 see:
       http://www.springer.de/comp/lncs/authors.html
   for further details. =

   The submission  should be sent  via = email, =20 in PDF format,=20 to

          &nb= sp;=20 Francisco Azevedo (fa@di.fct.unl.pt)

   The deadline for receipt of submissions = is June 30,=20 2005.
   Papers received after this date may not be=20 reviewed.
   Eligible  papers  will  = be =20 peer-reviewed  by  at least three
   members of = the=20 Program Committee.
   Authors will be notified via email of = the=20 results by July 22,
   2005.   Authors  of = accepted=20 papers  are expected  to improve
   their paper = based on=20 reviewers' comments and to send a camera
   ready version = of their=20 manuscripts by August 15, 2005.

   Accepted papers will = be=20 included in the workshop proceedings,
   which will be = distributed=20 to the participants.

   Questions about submissions may = be=20 directed to=20
            = fa@di.fct.unl.pt.

Organizing=20 Committee
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D  Francisco Azevedo  =20 (Universidade Nova de Lisboa)
  Carmen=20 Gervet       (IC-Parc)
  Enrico=20 Pontelli     (New Mexico State = University)

Program=20 Committee
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
 = ; Pedro=20 Barahona      (Universidade Nova de = Lisboa)
 =20 Pascal Brisset      (ENAC)
  Agostino=20 Dovier     (University of Udine)
  Zeynep=20 Kiziltan     (University of Bologna)
  Joao=20 Marques-Silva  (Universidade Tecnica de Lisboa)
  Enrico=20 Pontelli     (New Mexico State University)
  = Jean-Francois Puget (ILOG)
  Jean-Charles Regin  = (ILOG)
 =20 Andrew Sadler       (IC-Parc)
  = Toby=20 Walsh          (University = of New=20 South Wales)

Contact=20 Information
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D<= BR>     Francisco=20 Azevedo,
     CENTRIA,=20 FCT/UNL
     Departamento de=20 Informatica
     Quinta da=20 Torre
     2829-516 = Caparica
    =20 Portugal
     fa@di.fct.unl.pt
= ------=_NextPart_000_0042_01C55795.629EE010--