Program
The program is
here.
[ Back to top ]
Call For Paper
The workshop will cover all aspects of constraint and logic
programming, including various foundational issues, implementation
techniques, new applications as well as teaching issues. Particular
emphasis is on assessing the current state of the art and identifying
future directions.
We would like to invite authors to submit papers covering all aspects
of research on constraint and logic programming. Standard research
papers, position papers and work-in-progress papers describing current
projects are all welcome.
Submissions should be formatted in Springer LNCS format, and
be up to 15 pages in length. To submit a paper for the workshop, please
use the Easychair system -
https://www.easychair.org/login.cgi?conf=csclp2009
[ Back to top ]
Invited Speakers
We are happy to announce the following two invited talks:
[ Back to
top ]
Important Dates
The schedule of important dates for the workshop is as
follows:
| Paper submission deadline |
11th May 2009 |
| Notification of acceptance |
22nd May 2009
|
Scholarship request deadline
|
25th May 2009
|
| Camera-ready version deadline |
5th June 2009
|
| Registration deadline |
29th May 2009
|
| Proceedings online |
|
| Workshop date |
15-17 June 2009 |
[ Back to top ]
Publication
The proceedings of the workshop will be available online as a single
PDF file. A copy of the workshop proceedings will be given to the
participants.
After the workshop, we will decide whether to publish a subset of
papers in a Springer Lecture Notes on Artificial Intelligence (LNAI)
volume, as was done for previous editions of this workshop. In this
case, all the papers will have to go through a new peer-review and
selection process. Further details about this possibility will be given
during the workshop.
Organization
The organizers of the workshop are:
[ Back to top ]
Registration
The workshop is open to all and is not restricted to ERCIM members.
There is no registration fee.
Participants are kindly asked to register for the workshop before the
registration deadline by sending a message to the workshop chair at
larrosa@lsi.upc.edu
including your name, affiliation, e-mail and phone number.
Some limited scholarships may also be available.
Students who need support should ask their primary advisor to
send a reference
letter to Barry O'Sullivan (
b.osullivan@cs.ucc.ie)
before 25th May 2009.
[ Back to top ]
Travel, Accomodation and Venue
- Travel: The
main entrance gate to barcelona is its international airport. From the
airport, you can go to the city either by taxi (around 40 Euros), train
(service, every 30 minutes) or shuttle bus (service, every 20 minutes).
- Accomodation:
There is a full range of accomodation options in Barcelona. For your
convenience, you can use the services of ACTIVA Congresos. They have
selected two hotels with a good price/quality/location trade-off. Find here a description of these hotels. If
you choose to stay in one of them, find here
(here in pdf) the hotel reservation
form.
Finding accommodation in Barcelona may be difficult, so we strongly
recommend you an early booking. These rates will be maintained until
June 1, 2009. After this date booking availability and rates cannot be
guaranteed.
- Venue: The
workshop will take place in the
Omega building (room s208) at the UPC Campus Nord (c/ Jordi
Girona 1-3,
08034 Barcelona). The easiest way to reach the campus is by
subway (exit at "Palau Reial", green line). This
is a map of the campus where the blue dotted line shows the way
from the subway to the Omega building (5 minutes gentle uphill walk).
In order to find room s208 enter
the Omega building get into the elevator and go to the s2 floor.
In case you need it, my cell phone (Javier Larrosa) is 634 52 70 75.
- Moving around:
The simplest and fastest way to move around the city is the subway and
the bus system. It is recommendable that, upon arrival, you buy a T10
card (around 7 Euros) at any subway station. It allows you to make 10
trips. For each trip you can take once the subway and once the bus
(within an hour time period).
[ Back to top ]