9. CP 2003: Kinsale, Ireland

@proceedings{DBLP:conf/cp/2003,
  editor    = {Francesca Rossi},
  title     = {Principles and Practice of Constraint Programming - CP 2003,
               9th International Conference, CP 2003, Kinsale, Ireland, September
               29 - October 3, 2003, Proceedings},
  booktitle = {CP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2833},
  year      = {2003},
  isbn      = {3-540-20202-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Papers

• Henry A. Kautz, Bart Selman:
  Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. 1-18
  
• Tuomas Sandholm:
  Automated Mechanism Design: A New Application Area for Search Algorithms. 19-36
  
• Mark Wallace:
  Languages versus Packages for Constraint Problem Solving. 37-52
  
• Toby Walsh:
  Constraint Patterns. 53-64
  

Best Paper

• Pascal Van Hentenryck, Laurent Michel:
  Control Abstractions for Local Search. 65-80
  

Full Papers

• Ola Angelsmark, Peter Jonsson:
  Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. 81-95
  
• Carlos Ansótegui, Jose Larrubia, Felip Manyà:
  Boosting Chaff's Performance by Incorporating CSP Heuristics. 96-107
  
• Olivier Bailleux, Yacine Boufkhad:
  Efficient CNF Encoding of Boolean Cardinality Constraints. 108-122
  
• Russell Bent, Pascal Van Hentenryck:
  A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows. 123-137
  
• Stefano Bistarelli, Philippe Codognet, Kin Chuen Hui, Jimmy Ho-Man Lee:
  Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search. 138-152
  
• Stéphane Bourdais, Philippe Galinier, Gilles Pesant:
  HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care. 153-167
  
• Craig Boutilier, Relu Patrascu, Pascal Poupart, Dale Schuurmans:
  Constraint-Based Optimization with the Minimax Decision Criterion. 168-182
  
• Andrei A. Bulatov, Peter Jeavons:
  An Algebraic Approach to Multi-sorted Constraints. 183-198
  
• Hubie Chen:
  Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms. 199-213
  
• Chi Kan Cheng, Jimmy Ho-Man Lee, Peter J. Stuckey:
  Box Constraint Collections for Adhoc Constraints. 214-228
  
• Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey:
  Propagation Redundancy in Redundant Modelling. 229-243
  
• David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
  Soft Constraints: Complexity and Multimorphisms. 244-258
  
• Jorge Cruz, Pedro Barahona:
  Constraint Satisfaction Differential Problems. 259-273
  
• Tassos Dimitriou:
  A Wealth of SAT Distributions with Planted Assignments. 274-287
  
• Iván Dotú, Alvaro del Val, Manuel Cebrián:
  Redundant Modeling for the QuasiGroup Completion Problem. 288-302
  
• Boi Faltings, Santiago Macho-Gonzalez:
  Open Constraint Optimization. 303-317
  
• Alan M. Frisch, Christopher Jefferson, Ian Miguel:
  Constraints for Breaking More Row and Column Symmetries. 318-332
  
• Ian P. Gent, Warwick Harvey, Tom Kelsey, Steve Linton:
  Generic SBDD Using Computational Group Theory. 333-347
  
• Ian P. Gent, Holger H. Hoos, Andrew G. D. Rowley, Kevin Smyth:
  Using Stochastic Local Search to Solve Quantified Boolean Formulae. 348-362
  
• Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex:
  Solving Max-SAT as Weighted CSP. 363-376
  
• Keith Golden, Wanlin Pang:
  Constraint Reasoning over Strings. 377-391
  
• Martin J. Green, David A. Cohen:
  Tractability by Approximating Constraint Languages. 392-406
  
• Willem Jan van Hoeve:
  A Hybrid Constraint Programming and Semidefinite Programming Approach for the Stabe Set Problem. 407-421
  
• Alan Holland, Barry O'Callaghan, Barry O'Sullivan:
  A Constraint-Aided Conceptual Design Environment for Autodesk Inventor. 422-436
  
• Irit Katriel, Sven Thiel:
  Fast Bound Consistency for the Global Cardinality Constraint. 437-451
  
• Ludwig Krippahl, Pedro Barahona:
  Propagating N-Ary Rigid-Body Constraints. 452-465
  
• Javier Larrosa, Enric Morancho:
  Solving 'Still Life' with Soft Constraints and Bucket Elimination. 466-479
  
• Christophe Lecoutre, Frédéric Boussemart, Fred Hemery:
  Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms. 480-494
  
• Lengning Liu, Miroslaw Truszczynski:
  Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints. 495-509
  
• Andrea Lodi, Michela Milano, Louis-Martin Rousseau:
  Discrepancy-Based Additive Bounding for the AllDifferent Constraint. 510-524
  
• Michael J. Maher:
  A Synthesis of Constraint Satisfaction and Constraint Solving. 525-539
  
• Laurent Michel, Pascal Van Hentenryck:
  Maintaining Longest Paths Incrementally. 540-554
  
• David G. Mitchell:
  Resolution and Constraint Satisfaction. 555-569
  
• Angelo Oddi, Nicola Policella, Amedeo Cesta, Gabriella Cortellessa:
  Generating High Quality Schedules for a Spacecraft Memory Downlink Problem. 570-584
  
• Jean-Francois Puget:
  Symmetry Breaking Using Stabilizers. 585-599
  
• Claude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, Alexander Golynski, Sayyed Bashir Sadjad:
  An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. 600-614
  
• Stefan Ratschan:
  Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities. 615-633
  
• Jean-Charles Régin:
  Using Constraint Programming to Solve the Maximum Clique Problem. 634-648
  
• Mihaela Sabin, Eugene C. Freuder, Richard J. Wallace:
  Greater Efficiency for Conditional Constraint Satisfaction. 649-663
  
• T. K. Satish Kumar:
  Incremental Computation of Resource-Envelopes in Producer-Consumer Models. 664-678
  
• Meinolf Sellmann:
  Approximated Consistency for Knapsack Constraints. 679-693
  
• Meinolf Sellmann:
  Cost-Based Filtering for Shorter Path Constraints. 694-708
  
• Cyril Terrioux, Philippe Jégou:
  Bounded Backtracking for the Valued Constraint Satisfaction Problems. 709-723
  
• Toby Walsh:
  Consistency and Propagation with Multiset Constraints: A Formal Viewpoint. 724-738
  
• Armin Wolf:
  Pruning while Sweeping over Task Intervals. 739-753
  
• Lin Xu, Berthe Y. Choueiry:
  Improving Backtrack Search for Solving the TCSP. 754-768
  
• Neil Yorke-Smith, Carmen Gervet:
  Certainty Closure: A Framework for Reliable Constraint Reasoning with Uncertainty. 769-783
  

Poster Papers

• Nicos Angelopoulos:
  clp(pdf(y)): Constraints for Probabilistic Reasoning in Logic Programming. 784-788
  
• Christian Bessière, Pascal Van Hentenryck:
  To Be or Not to Be ... a Global Constraint. 789-794
  
• Sebastian Brand, Rosella Gennari, Maarten de Rijke:
  Constraint Programming for Modelling and Solving Modal Satisfability. 795-800
  
• Ismel Brito, Pedro Meseguer:
  Distributed Forward Checking. 801-806
  
• David A. Cohen:
  A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure. 807-811
  
• Remi Coletta, Christian Bessière, Barry O'Sullivan, Eugene C. Freuder, Sarah O'Connell, Joël Quinqueton:
  Semi-automatic Modeling by Constraint Acquisition. 812-816
  
• Emilie Danna, Laurent Perron:
  Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs. 817-821
  
• Carlos Eisenberg, Boi Faltings:
  Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems. 822-826
  
• Antonio J. Fernández, Maria Teresa Hortalá-González, Fernando Sáenz-Pérez:
  Toy(FD): Sketch of Operational Semantics. 827-831
  
• Jeremy Frank, Richard Dearden:
  Scheduling in the Face of Uncertain Resource Consumption and Utility. 832-836
  
• Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei:
  Supertree Construction with Constraint Programming. 837-841
  
• Enrico Giunchiglia, Marco Maratea, Armando Tacchella:
  (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver. 842-846
  
• Nuno Gomes, Zita A. Vale, Carlos Ramos:
  Reduce and Assign: A Constraint Logic Programming and Local Search Integration Framework to Solve Combinatorial Search Problems. 847-852
  
• Stéphane Grandcolas, Laurent Henocque, Nicolas Prcovic:
  A Canonicity Test for Configuration. 853-857
  
• Fabrizio Grandoni, Giuseppe F. Italiano:
  Improved Algorithms for Max-restricted Path Consistency. 858-862
  
• Alessio Guerri, Michela Milano:
  CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions. 863-867
  
• Wen Qi Huang, Yu Li, Bernard Jurkowiak, Chu Min Li, Ru Chu Xu:
  A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container. 868-872
  
• George Katsirelos, Fahiem Bacchus:
  Unrestricted Nogood Recording in CSP Search. 873-877
  
• François Laburthe:
  Constraints over Ontologies. 878-882
  
• François Laburthe, Yves Caseau:
  Using Constraints for Exploring Catalogs. 883-888
  
• Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh Dao, AbdelAli Ed-Dbali:
  Intermediate (Learned) Consistencies. 889-893
  
• David Larkin:
  Semi-independent Partitioning: A Method for Bounding the Solution to COP's. 894-898
  
• Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim McFadden, Yoav Shoham:
  Boosting as a Metaphor for Algorithm Design. 899-903
  
• Olivier Lhomme:
  An Efficient Filtering Algorithm for Disjunction of Constraints. 904-908
  
• Bertrand Neveu, Gilles Trombettoni:
  INCOP: An Open Library for INcomplete Combinatorial OPtimization. 909-913
  
• Seiichi Nishihara, Kazunori Mizuno, Kohsuke Nishihara:
  A Composition Algorithm for Very Hard Graph 3-Colorability Instances. 914-919
  
• Shuji Ohnishi, Hiroaki Tasaka, Naoyuki Tamura:
  Efficient Represenation of Discrete Sets for Constraint Programming. 920-924
  
• Adrian Petcu, Boi Faltings:
  Applying Interchangeability Techniques to the Distributed Breakout Algorithm. 925-929
  
• Karen E. Petrie, Barbara M. Smith:
  Symmetry Breaking in Graceful Graphs. 930-934
  
• Nicolas Prcovic:
  Tree Local Search. 935-939
  
• Steven David Prestwich, Desmond G. Higgins, Orla O'Sullivan:
  A SAT-Based Approach to Multiple Sequence Alignment. 940-944
  
• Igor Razgon, Amnon Meisels:
  Maintaining Dominance Consistency. 945-949
  
• Tuomas Sandholm:
  Terminating Decision Algorithms Optimally. 950-955
  
• Gilles Trombettoni, Marta Wilczkowiak:
  Scene Reconstruction Based on Constraints: Details on the Equation System Decomposition. 956-961
  

Doctoral Abstracts

• Carlos Ansótegui:
  A New Approach to Solving SAT-Encoded Binary CSPs. 962
  
• Muhammed Basharu:
  FeReRA: A Multi-agent Approach to Constraint Satisfaction. 963
  
• Heikel Batnini, Michel Rueher:
  Semantic Decomposition for Solving Distance Constraints. 964-965
  
• Julien Bidot:
  Using Constraint Programming and Simulation for Execution Monitoring and On-Line Rescheduling with Uncertainty. 966
  
• Jlifi Boutheina, Khaled Ghédira:
  On the Enhancement of the Informed Backtracking Algorithm. 967
  
• Ole Boysen:
  Extending CLP with Metaheuristics. 968
  
• Tom Carchrae:
  Self Configuring Constraint Programming Systems. 969
  
• Moyra Duggan, Barry O'Sullivan, Eugene C. Freuder:
  Interactive Tradeoff Generation. 970
  
• Pierre Flener, Justin Pearson, Magnus Ågren:
  Introducing ESRA, a Relational Language for Modelling Combinatorial Problems. 971
  
• James Gibbons:
  Abstracting Constraints Using Constraints. 972
  
• Diarmuid Glynn:
  Sensitivity Analysis in CSPs. 973
  
• Emmanuel Hebrard:
  Solution Stability in Constraint Satisfaction Problems. 974
  
• Michael Heusch:
  distn: An Euclidean Distance Global Constraint. 975
  
• Alan Holland, Barry O'Sullivan:
  Algorithmic Mechanism Design and Constraints. 976
  
• Rémy-Robert Joseph, Peter Chan, Michael Hiroux, Georges Weil:
  Preference Constraints: New Global Soft Constraints Dedicated to Preference Binary Relations. 977
  
• Jerome Kelleher, Barry O'Sullivan:
  Optimising the Representation and Evaluation of Semiring Combination Constraints. 978
  
• Zeynep Kiziltan:
  Symmetry Breaking Ordering Constraints. 979
  
• Ludovic Langevine:
  Observation of Constraint Programs. 980
  
• Wojciech Legierski:
  Search Programming. 981
  
• Chavalit Likitvivatanavong:
  Exploiting Microstructure in CSPs. 982
  
• James Little, Cormac Gebruers, Derek G. Bridge, Eugene C. Freuder:
  Using Case-Based Reasoning to Write Constraint Programs. 983
  
• Toni Mancini:
  Reformulation Techniques for a Class of Permutation Problems. 984
  
• Iain McDonald:
  NuSBDS: An Easy to Use Symmetry Breaking System. 985
  
• Tomás Müller:
  Interactivity in Constraint Programming. 986
  
• Tomas Eric Nordlander, Ken N. Brown, Derek H. Sleeman:
  Identifying Inconsistent CSPs by Relaxation. 987
  
• Barry O'Callaghan, Eugene C. Freuder, Barry O'Sullivan:
  Useful Explanations. 988
  
• Sarah O'Connell, Barry O'Sullivan, Eugene C. Freuder:
  Teacher and Learner Profiles for Constraint Acquisition. 989
  
• Karen E. Petrie:
  Comparison of Symmetry Breaking Methods. 990
  
• Jordi Planes:
  Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT. 991
  
• Colin Quirke:
  Search for Mathematical Objects. 992
  
• Guillaume Rochart:
  Explanations for Global Constraints. 993
  
• Andrew G. D. Rowley:
  Watching Clauses in Quantified Boolean Formulae. 994
  
• Hans Schlenker:
  Distributed Constraint-Based Railway Simulation. 995
  
• Daniel Sheridan:
  Dynamic Step Size Adjustment in Iterative Deepening Search. 996
  
• Paula Sturdy:
  Learning Good Variable Orderings. 997
  
• Ann Tighe, Finlay S. Smith, Gerard Lyons:
  An Adaptive Controller for Real-Time Resolution of the Vehicle Routing Problem. 998
  
• Kristen Brent Venable:
  alpha-Dynamic Controllability of Simple Temporal Problems with Preferences and Uncertainty. 999
  
• Petr Vilím:
  Computing Explanations for Global Scheduling Constraints. 1000
  
• Huayue Wu, Peter van Beek:
  Restart Strategies: Analysis and Simulation. 1001
  
• Peter Zoeteweij:
  OpenSolver: A Coordination-Enabled Abstract Branch-and-Prune Tree Search Engine. 1002
  

Last update Tue Feb 14 03:52:05 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page