Back to CP 2003 home-page


CP 2003 List of accepted papers

There were 181 submissions, of which 48 were accepted as full papers. See, also, the list of accepted posters.

List of accepted papers

APPROXIMATED CONSISTENCY FOR KNAPSACK CONSTRAINTS Meinolf Sellmann

SOLVING EXISTENTIALLY QUANTIFIED CONSTRAINTS WITH ONE EQUALITY AND ARBITRARILY MANY INEQUALITIES Stefan Ratschan

TRACTABILITY BY APPROXIMATING CONSTRAINT LANGUAGES Martin J Green and David A Cohen

PERIODIC CONSTRAINT SATISFACTION PROBLEMS: POLYNOMIAL-TIME ALGORITHMS Hubie Chen

FAST BOUND CONSISTENCY FOR THE GLOBAL CARDINALITY CONSTRAINT Irit Katriel and Sven Thiel

INCREMENTAL COMPUTATION OF RESOURCE-ENVELOPES IN PRODUCER-CONSUMER MODELS T. K. Satish Kumar

OPEN CONSTRAINT OPTIMIZATION Boi Faltings Santiago Macho-Gonzalez

A HYBRID CONSTRAINT PROGRAMMING AND SEMIDEFINITE PROGRAMMING APPROACH FOR THE STABLE SET PROBLEM W.J. van Hoeve

PRUNING WHILE SWEEPING OVER TASK INTERVALS Armin Wolf

SOFT CONSTRAINTS: COMPLEXITY AND MULTIMORPHISMS David Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin

SOLVING 'STILL LIFE' WITH SOFT CONSTRAINTS AND BUCKET ELIMINATION Javier Larrosa Enric Morancho

AN EFFICIENT BOUNDS CONSISTENCY ALGORITHM FOR THE GLOBAL CARDINALITY CONSTRAINT C.-G. Quimper, P. van Beek, A. Lopez-Ortiz, A. Golynski, S. B. Sadjad

A WEALTH OF SAT DISTRIBUTIONS WITH PLANTED ASSIGNMENTS Tassos Dimitriou

GENERIC SBDD USING COMPUTATIONAL GROUP THEORY Ian Gent, Warwick Harvey, Tom Kelsey, Steve Linton

USING CONSTRAINT PROGRAMMING TO SOLVE THE MAXIMUM CLIQUE PROBLEM Jean-Charles Regin

CONTROL ABSTRACTIONS FOR LOCAL SEARCH Pascal Van Hentenryck Laurent Michel

MAINTAINING LONGEST PATHS INCREMENTALLY Laurent Michel Pascal Van Hentenryck

AN ALGEBRAIC APPROACH TO MULTI-SORTED CONSTRAINTS Andrei Bulatov and Peter Jeavons

SOLVING FINITE DOMAIN CONSTRAINT HIERARCHIES BY LOCAL CONSISTENCY AND TREE SEARCH S. Bistarelli, P. Codognet, H.K.C. Hui, J.H.M. Lee

PROPAGATION REDUNDANCY IN REDUNDANT MODELLING C.W. Choi and J.H.M. Lee and P. J. Stuckey

BOX CONSTRAINT COLLECTIONS FOR ADHOC CONSTRAINTS K. C. K. Cheng and J.H.M. Lee and P. J. Stuckey

IMPROVED ALGORITHMS FOR COUNTING SOLUTIONS IN CONSTRAINT SATISFACTION PROBLEMS Ola Angelsmark Peter Jonsson

A TWO-STAGE HYBRID ALGORITHM FOR PICKUP AND DELIVERY VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS Russell Bent and Pascal Van Hentenryck

CONSTRAINT SATISFACTION DIFFERENTIAL PROBLEMS Jorge Cruz Pedro Barahona

USING STOCHASTIC LOCAL SEARCH TO SOLVE QUANTIFIED BOOLEAN FORMULAE Ian P Gent, Holger H Hoos, Andrew G D Rowley and Kevin Smyth

BOUNDED BACKTRACKING FOR THE VALUED CONSTRAINT SATISFACTION PROBLEMS Cyril Terrioux and Philippe Jegou

LOCAL-SEARCH TECHNIQUES FOR PROPOSITIONAL LOGIC EXTENDED WITH CARDINALITY CONSTRAINTS Lengning Liu and Miroslaw Truszczynski

COST-BASED FILTERING FOR SHORTEST PATH CONSTRAINTS Meinolf Sellmann

EFFICIENT CNF ENCODING OF BOOLEAN CARDINALITY CONSTRAINTS Olivier Bailleux Yacine Boufkhad

FROM AC3 TO AC7 Christophe Lecoutre Frederic Boussemart Fred hemery

A CONSTRAINT-AIDED CONCEPTUAL DESIGN ENVIRONMENT FOR AUTODESK INVENTOR Alan Holland, Barry O?Callaghan, and Barry O?Sullivan

CONSTRAINT PROGRAMMING WITH MULTISETS Toby Walsh

DISCREPANCY BASED ADDITIVE BOUNDING FOR THE ALLDIFFERENT CONSTRAINT Andrea Lodi, Michela Milano, Louis-Martin Rousseau

SOLVING MAX-SAT AS WEIGHTED CSP Simon de Givry, Javier Larrosa, Pedro Meseguer,Thomas Schiex

PROPAGATING N-ARY RIGID-BODY CONSTRAINTS Ludwig Krippahl, Pedro Barahona

THE CERTAINTY CLOSURE FRAMEWORK: RELIABLE CONSTRAINT REASONING WITH UNCERTAIN DATA Neil Yorke-Smith and Carmen Gervet

BOOSTING CHAFF'S PERFORMANCE BY INCORPORATING CSP HEURISTICS. Carlos Ansotegui, Jose Larrubia and Felip Manya

IMPROVING BACKTRACK SEARCH FOR SOLVING THE TCSP Lin XU and Berthe Y. CHOUEIRY

HIBISCUS: A CONSTRAINT PROGRAMMING APPLICATION TO STAFF SCHEDULING IN HEALTH CARE Stephane Bourdais, Philippe Galinier, and Gilles Pesant

GENERATING HIGH QUALITY SCHEDULES FOR SPACECRAFT MEMORY DOWNLINK PROBLEMS Angelo Oddi, Nicola Policella, Amedeo Cesta and Gabriella Cortellessa

SYMMETRY BREAKING FOR MATRIX MODELS USING STABILIZERS Jean-Francois Puget

CONSTRAINT-BASED OPTIMIZATION AND ELICITATION WITH THE MINIMAX DECISION CRITERION Craig Boutilier, Relu Patrascu, Pascal Poupart, Dale Schuurmans

RESOLUTION AND CONSTRAINT SATISFACTION David G. Mitchell

REDUNDANT MODELING FOR THE QUASIGROUP COMPLETION PROBLEM Ivan Javier Dotu Rodriguez, Alvaro del Val, Manuel Cebrián

A SYNTHESIS OF CONSTRAINT SATISFACTION AND CONSTRAINT SOLVING Michael J. Maher

CONSTRAINTS FOR BREAKING MORE ROW AND COLUMN SYMMETRIES Dr. Ian Miguel, Chris Jefferson, Dr. Alan Frisch

CONSTRAINT REASONING OVER STRINGS Keith Golden Wanlin Pang

GREATER EFFICIENCY FOR CONDITIONAL CONSTRAINT SATISFACTION Mihaela Sabin, Eugene .C. Freuder, and Richard J. Wallace
A disclaimer applies to this page. This page is not part of the official UCC website. This page is maintained to support the smooth running of the CP2003 conference.