CP 2003 List of accepted poster papers

 

·        clp(pfd(Y)): Constraints for Probabilistic Reasoning in Logic Programming

     Nicos Angelopoulos

 

·        To Be or Not to Be ... a Global Constraint

Christian Bessiere and Pascal Van Hentenryck

 

·        Constraint Programming for Modelling and Solving Modal Satisfiability

Sebastian Brand, Rosella Gennari and Maarten de Rijke

 

·        Distributed Forward Checking

Ismel Brito and Pedro Meseguer

 

·        A New Class of Binary CSPs for which Arc Consistency is a Decision Procedure

D. A. Cohen

 

·        Semi-Automatic Modeling by Constraint Acquisition

Remi Coletta, Christian Bessiere, Barry O'Sullivan,

Eugene C. Freuder, Sarah O'Connell and Joel Quinqueton

 

·        Structured Vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs

Emilie Danna and Laurent Perron

 

·        Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems

Carlos Eisenberg and Boi Faltings

 

·        Toy(FD): Sketch of Operational Semantics

Antonio J. Fernandez, Teresa Hortala-Gonzalez and Fernando Saenz-Perez

 

·        Scheduling in the Face of Uncertain Resource Consumption and Utility

Jeremy Frank and Richard Dearden

 

·        Supertree Construction with Constraint Programming

Ian P. Gent, Patrick Prosser, Barbara M. Smith and Wu Wei

 

·        (In)Effectiveness of Look-ahead Techniques in a Modern SAT Solver

Enrico Giunchiglia, Marco Maratea and Armando Tacchella

 

·        Reduce and Assign: A Constraint Logic Programming and Local Search Integration Framework to Solve Combinatorial Search Problems

Nuno Gomes, Zita Vale and Carlos Ramos

 

·        A Canonicity Test for Configuration

Stephane Grandcolas, Laurent Henocque and Nicolas Prcovic

 

·        Improved Algorithms for Max-Restricted Path Consistency

Fabrizio Grandoni and Giuseppe F. Italiano

 

·        CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions

Alessio Guerri and Michela Milano

 

·        A Two-level Search Strategy for Packing Unequal Circles into a Circle Container

Wen Qi Huang, Yu Li, Bernard Jurkowiak, Chu Min Li and Ru Chu Xu

 

·        Unrestricted Nogood Recording in CSP Search

George Katsirelos and Fahiem Bacchus

 

·        Constraints over Ontologies

Francois Laburthe

 

·        Using Constraints for Exploring Catalogs

Francois Laburthe and Yves Caseau

 

·        Intermediate (Learned) Consistencies

Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, Abdelali Ed-Dbali

 

·        Semi-Independent Partitioning: A Method for Bounding the Solution to COP's

David Larkin

 

·        Boosting as a Metaphor for Algorithm Design

Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim McFadden, Yoav Shoham

 

·        An Efficient Filtering Algorithm for Disjunction of Constraints

Olivier Lhomme

 

·        INCOP: An Open Library for INcomplete Combinatorial OPtimization

Bertrand Neveu and Gilles Trombettoni

 

·        A Composition Algorithm for Very Hard Graph 3-Colorability Instances

Seiichi Nishihara, Kazunori Mizuno, Kohsuke Nishihara

 

·        Efficient Representation of Discrete Sets for Constraint Programming

Shuji Ohnishi, Hiroaki Tasaka, Naoyuki Tamura

 

·        Applying Interchangeability Techniques to the Distributed Breakout Algorithm

Adrian Petcui, Boi Faltings

 

·        Symmetry Breaking In Graceful Graphs

Karen E. Petrie and Barbara M. Smith

 

·        Tree Local Search

Nicolas Prcovic

 

·        A SAT-Based Approach to Multiple Sequence Alignment

Steven Prestwich, Des Higgins and Orla O'Sullivan

 

·        Maintaining Dominance Consistency

Igor Razgon and Amnon Meisels

 

·        Terminating Decision Algorithms Optimally

Tuomas Sandholm

 

·        Scene Reconstruction Based on Constraints: Details on the Equation System Decomposition

Gilles Trombettoni and Marta Wilczkowiak