WLP
2009
23rd
Workshop on (Constraint) Logic Programming
Potsdam, Germany
September 15/16, 2009
Co-located with LPNMR'09 - 10th
International Conference on Logic Programming and
Nonmonotonic Reasoning
Preliminary Workshop Program and Papers added!
General |
Topics |
Proceedings |
Submission |
Dates | Program | Invited Talks | Registration |
Local Info |
Program Committee |
Contact
The workshops on (constraint) logic programming
are the annual meeting of the
Society of Logic Programming (GLP e.V.)
and bring together researchers
interested in logic programming, constraint programming, and related
areas like databases, artificial intelligence and operations research. Previous workshops
have been held in Germany, Austria and Switzerland.
The technical program of the workshop will include an invited talk,
presentations of refereed papers and demo presentations.
Previous
workshops took place in Dresden
(2008), Würzburg
(2007),
Vienna
(2006),
Ulm
(2005),
Potsdam
(2004),
Dresden
(2002),
Kiel
(2001),...
Call for Papers
Contributions are welcome on all theoretical, experimental, and
application aspects of constraint programming (CP) and
logic programming (LP), including, but not limited to (the order
does not reflect priorities):
- Foundations of Constraint/Logic Programming
- Constraint Solving and Optimization
- Extensions: Functional Logic Programming, Objects
- Deductive Databases, Data Mining
- Nonmonotonic Reasoning
- Dynamics, Updates, States, Transactions
- Interaction of CP/LP with other formalisms like Agents,
XML, JAVA
- Program Analysis, Program Transformation, Program
Verification, Meta Programming
- Parallelism and Concurrency
- Answer-set Programming
- Implementation Techniques
- Software Techniques (e.g., Types, Modularity, Design
Patterns)
- Applications (e.g., in Production, Environment, Education,
Internet)
- Constraint/Logic Programming for Semantic Web Systems and
Applications
- Reasoning on the Semantic Web
- Data Modeling for the Web, Semistructured Data, and Web
Query Languages
The primary focus is on new and original research results but
submissions describing innovative products, prototypes under
development, interesting experiments (e.g., benchmarks) or ongoing scientific work are also encouraged.
The proceedings are
published as a technical report of the
Institute of Computer Science, Potsdam University.
They are online available. Moreover, a printed version of the proceedings is available, too:
Ulrich Geske; Armin Wolf (eds.): Procceedings of the 23rd Workshop on
(Constraint)
Logic Programming 2009, Universitätsverlag Potsdam, 2010. ISBN
978-3-86956-026-7.
Copies can be ordered at the Universitätsverlag Potsdam.
Authors are invited to submit an extended
abstract
(no longer than
10 pages including figures and references) or a system
description
(no longer than 3 pages) in PDF or Postscript format (11pt)
before August 09, 2009 via EasyChair.
All submissions must be written in English.
Authors are strongly encouraged to use LaTeX2e and
the Springer llncs class file, available
here.
All submissions must be unpublished original work.
However, work
that already appeared
in unpublished or informally published workshops proceedings may be
submitted, too.
If you have any problems with submitting papers, please send an email
to armin.wolf@first.fraunhofer.de or ulrich.geske@uni-potsdam.de.
| Submission of papers: |
August 9, 2009 (closed) |
| Notification of acceptance: |
August 21, 2009 (closed) |
| Camera-ready papers: |
September 10, 2009 (closed) |
| Workshop: |
September 15/16, 2009 (accomplished) |
| Ready-for-printing papers: | October 16, 2009 (closed) |
| Program (NEW: with Links to the Publications) |
Thuesday, September 15
Wednesday, September 16
... continued in the LPNMR'09 program
on an "Overview of the Monadic Constraint Programming Framework" by Tom Schrijvers
(KU Leuven, Belgium)
Abstract
A constraint programming system combines two essential components: a
constraint solver and a search engine. The constraint solver reasons
about satisfiability of conjunctions of constraints, and the search
engine controls the search for solutions by iteratively exploring a
disjunctive search tree defined by the constraint program.
The Monadic Constraint Programming framework gives a monadic definition of
constraint programming where the solver is defined as a monad threaded
through the monadic search tree. Search and search strategies can then be
defined as firstclass objects that can themselves be built or extended by
composable search transformers. Search transformers give a powerful and
unifying approach to viewing search in constraint programming, and the
resulting constraint programming system is first class and extremely
flexible.
on "What I have learned from all these solver competitions" by Neng-Fa Zhou (City University of New York, USA)
Abstract
In
this talk, I would like to share my experiences gained from
participating in four CSP competitions and the second ASP solver
competition. In particular, I'll talk about how various programming
techniques can make huge differences in solving some of the benchmark
problems used in the competitions. These techniques include global
constraints, table constraints, and problem-specific propagators and
labeling strategies for selecting variables and values. I'll present
these techniques with experimental results from B-Prolog and other
CLP(FD) systems.
Further Invited Talks at LPNMR'09
Moreover, there is the opportunity to participate in the invited talks at LPNMR'09 given by
- Armin Biere (Johannes Kepler University, Austria),
- Alexander Bockmayr (Freie Universität Berlin, Germany)
- Ilkka Niemelä (Helsinki University of Technology, Finland).
To register for WLP 2009 please consider the LPNMR'09 registration information and its registration form.
For information on travel please consider LPNMR'09 "Getting to Potsdam" and for accommodation suggestions
visit the LPNMR'09 accommodation web page.
Slim
Abdennadher (German University Cairo)
Christoph Beierle (FernUniv. Hagen)
Stefan Brass (MLU Halle-Wittenberg)
Jürgen Dix (Clausthal University of Technology)
Tim Furche (LMU München)
Ulrich Geske (Univ. Potsdam, Speaker FG 1.1.1.)
Hans-Joachim Goltz (Fraunhofer FIRST)
Michael Hanus (CAU Kiel)
Heinrich Herre (Univ. Leipzig)
Steffen Hölldobler (TU Dresden)
Petra Hofstedt (TU Berlin)
Ulrich John (SIR Plan GmbH)
Michael Leuschel (Univ. Düsseldorf)
Ulrich Neumerkel (TU Wien)
Frank Raiser (Univ. Ulm)
Georg Ringwelski (Hochschule Zittau/Görlitz)
Sibylle Schwarz (Hochschule Zwickau)
Dietmar Seipel (Univ. Würzburg)
Michael Thielscher (TU Dresden)
Hans Tompits (TU Wien)
Armin Wolf (Fraunhofer FIRST)
Dr. Armin Wolf
e-mail: armin.wolf@first.fraunhofer.de
Fraunhofer-Institut für Rechnerarchitektur
und Softwaretechnik, FIRST
Kekuléstraße 7
12489 Berlin
|
Prof. Dr. Ulrich Geske
e-mail: ulrich.geske@uni-potsdam.de
Universität Potsdam
Institut für Informatik
Haus 4
August-Bebel-Straße 89
14482 Potsdam
|
Armin Wolf, mailto:armin.wolf@first.fraunhofer.de
