CSCLP 2010
Annual
ERCIM Workshop on
Constraint Solving and Constraint Logic Programming
November 25 - 26, 2010
Fraunhofer
FIRST, Berlin, Germany
NEW: proceedings and presentations added
General | Call for Papers |
Proceedings | Organization |
Important Dates | Program
| Invited Talk
| Systems Demonstration | Registration
|
Local Info
| Support | Imprint
The workshops on (constraint) logic programming
are the annual meeting of the ERCIM Working Group on Constraints .
This working group aims to
bring together ERCIM researchers that are involved in research on the
subject of constraint programming and related areas.
Its primary aims are:
- to promote research on this subject within the ERCIM
institutions,
- facilitate the exchange of information,
- coordinate efforts in technology transfer,
- facilitate the exchange of researchers for short and long
visits.
The workshop will cover all aspects of constraint solving and constraint (logic)
programming, including various foundational issues, implementation
techniques, new (practical) 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 equally 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 at
http://www.easychair.org/conferences/?conf=csclp2010.
The proceedings of the workshop will be available online in PDF. 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.
The organizers of the workshop are:
| Paper submission deadline (extended): |
October 24, 2010 (closed) |
| Notification
of acceptance: | October 31, 2010 (closed) |
| Camera-ready version deadline: | November
14, 2010 (closed) |
| Registration deadline: |
November 14, 2010 (closed) |
| Workshop date: | November 25 - 26, 2010 |
Thursday, November 25, 2010
13:30 - 14:00: Opening and Welcome
14:00 - 15:00: Invited Talk by J. Christopher Beck on CP/MIP
Hybridization via Logic-based Benders Decomposition
15:00 - 15:30: Son Tung Nguyen and Roman Barták on Solving the Rotation Assignment Problem for Airlines Using Constraint Programming
15:30 - 16:00: Coffee Break
16:00 - 16:30: Pavel Surynek on An Adaptation of Path Consistency for Boolean Satisfiability: a Theoretical View of the Concept
16:30 - 17:00: Roger Kameugne
and Laure Pauline Fotso on A Complete Filtering Algorithm for
Cumulative Not-First/Not-Last rule in O(n² |H| log n)
Friday, November 26, 2010
9:30 - 10:30: Systems Demonstration by Armin Wolf and Hans-Joachim Goltz on CP Applications at Fraunhofer FIRST
10:30 - 11:00: Helmut Simonis and Barry O'Sullivan on Almost Square Packing
11:00 - 11:30: Coffee Break
11:30 - 12:00: Tarik Hadzic and Helmut Simonis on Creating Tests for a Family of Cost Aware Resource Constraints
12:00 - 12:30: Rémy Haemmerlé on (Co)inductive Semantics for Constraint Handling Rules
An invited talk will be given by J. Christopher Beck, University of Toronto, an expert in Constraint Programming on:
CP/MIP
Hybridization via Logic-based Benders Decomposition
From Constraint Programming to Logic-Based Benders Decomposition (and back!)
Abstract
Logic-based
Benders decomposition (LBBD) is a general
decomposition scheme that has been applied to a number of
hard-combinatorial
problems in the past 10 years. While not inherent to the approach, LBBD
provides an excellent architecture for combinations of mixed-integer
programming and constraint programming. In this talk, I will present
two such
hybrid models -- for a facility location-truck allocation problem and
for a
maintenance scheduling problem -- that demonstrate orders-o-f-magnitude
improvements over existing approaches. Time permitting, investigations
of
branch-and-check, a generalization of LBBD, will be presented.
A systems demonstration will be given by Armin Wolf and Hans-Joachim Goltz from Fraunhofer FIRST about
CP Applications at Fraunhofer FIRST
Abstract
The
CP applications realized at Fraunhofer FIRST are ranging from
production scheduling, timetabling, interactive appointment and surgery
scheduling in medicine over load distribution in
maintenance/repair/overhaul and in energy networks to partition
scheduling for multi-core/many-core architectures. Some of these
systems will be presented in live demonstations.
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, November 14, 2010 by sending a message to the workshop chair at armin.wolf@first.fraunhofer.de
including your name, affiliation, e-mail and phone number.
Fraunhofer FIRST is located in Berlin-Adlershof, close to Schönefeld airport and the "Autobahn"; details can be found here and in the OpenStreetMap.
For accomodation there are lots of hotels in Berlin, most of them can be booked via Hotel Reservation Service or Booking.com. Additionally the Dorint Hotel
nearby the institute has a special offer for our guests. The
price is 63,-- € per night in a single room without breakfast;
breakfast is 13,--€ extra. In order to book this offer, please let them
know that you are guests from Fraunhofer FIRST.
Fraunhofer FIRST will host the workshop.
Dr. Armin
Wolf, mailto:csclp2010@easychair.org
Imprint
