Analysis and Visualization of Constraint Programs and Solvers

September 22, 2000

Hilton Singapore

a CP 2000 Workshop

[Dates] [Program] [Contributions] [Organization]
Constraint programming (CP) is an emergent paradigm to solve, flexibly and efficiently, a large class of combinatorial problems. Its applications can be found in various domains. Nervertheless, CP is not as widely used as it should by industrials. A main reason of this difficulty was the lack of programming environments.

The last five years have witnessed substantial developments in this area, ranging from theoretical frameworks to the design and implementation of debugging tools.

The workshop invites papers describing ongoing work in the following topics (but are not limited to):

In addition to regular submissions to be presented at the workshop, system demos related to the topics above are also welcome.

Dates

Submission of contribution June 30, 2000
Notification of acceptance July 29, 2000
Final versions for proceedings September 1, 2000
CP Conference September 18 - 22, 2000
Workshop September 22, 2000

Program

The program will consist of four presentations, selected from the submitted papers, and three demo presentations.
9:00-9:30 After DiSCiPl, OADymPPac, a new french project on Dynamic Analysis and Debugging of Constraint Programs,
Pierre Deransart
9:30-10:00 Visualizing Constraints in Visualization Rules,
Shin Takahashi
10:00-10:30 A Case Study in Explanation and Implication,
Eugene C. Freuder, Chavalit Likitvivatanavong, Richard J. Wallace
10:30-11:00 Coffee break
11:00-11:30 Visualization of Incremental All-Integer Algorithms,
Jean-Claude Sogno
11:30-12:00 An Overview of The CACP Project: Modelling And Solving Constraint Satisfaction/Optimisation Problems With Minimal Expert Intervention,
Richard Bradwell, John Ford, Patrick Wills, Edward Tsang, Richard Williams

12:00-12:15 Oz Explorer: Interactive and Visual Search,
Christian Schulte
Investigating Constraints with Graph Views,
Tobias Mueller
12:15:12-30 VisualCHR: Visualization of Constraint Propagation in Constraint Handling Rules,
Slim Abdennadher, Matthias Saft
12:30-14:00 Lunch

Contributions

Research Papers should be no longer than 5000 words in length, including a 150 to 200 word abstract. Demo descriptions should be no longer than 2000 words including a 150 to 200 word abstract. Please Submit papers and demo descriptions by sending a Ghostview-readable Postscript file containing the article to the program chair: Slim Abdennadher Slim.Abdennadher@informatik.uni-muenchen.de.

Organization

Slim Abdennadher, University of Munich,
Frédéric Benhamou, University of Nantes,
Pierre Deransart, INRIA Rocquencourt,
Mireille Ducassé, INSA Rennes,
Manuel Hermenegildo, Universidad Politécnica de Madrid,
Christian Schulte, Universität des Saarlandes,
Helmut Simonis, COSYTEC
page maintained by Slim Abdennadher