10. CP 2004: Toronto, Canada

Invited Papers

• Andreas Podelski:
  Constraints in Program Analysis and Verification. 1-4
  
• Jean-Francois Puget:
  Constraint Programming Next Challenge: Simplicity of Use. 5-8
  
• Bart Selman:
  Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics. 9-12
  
• Helmut Simonis:
  Challenges for Constraint Programming in Networking. 13-16
  

Distinguished Papers

• Yong Gao, Joseph C. Culberson:
  Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. 17-31
  
• Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière:
  Statistical Regimes Across Constrainedness Regions. 32-46
  
• Pascal Van Hentenryck, Laurent Michel, Liyuan Liu:
  Constraint-Based Combinators for Local Search. 47-61
  
• Petr Vilím, Roman Barták, Ondrej Cepek:
  Unary Resource Constraint with Optional Activities. 62-76
  

Full Papers

• Albert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi:
  Constraint Propagation as a Proof System. 77-91
  
• J. Christopher Beck, Tom Carchrae, Eugene C. Freuder, Georg Ringwelski:
  Backtrack-Free Search for Real-Time Constraint Satisfaction. 92-106
  
• Nicolas Beldiceanu, Mats Carlsson, Thierry Petit:
  Deriving Filtering Algorithms from Constraint Checkers. 107-122
  
• Christian Bessière, Remi Coletta, Eugene C. Freuder, Barry O'Sullivan:
  Leveraging the Learning Power of Examples in Automated Constraint Acquisition. 123-137
  
• Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Toby Walsh:
  Disjoint, Partition and Intersection Constraints for Set and Multiset Variables. 138-152
  
• Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Marie Déplanche, Narendra Jussien, Yvon Trinquet:
  Decomposition and Learning for a Hard Real Time Task Allocation Problem. 153-167
  
• Hubie Chen:
  Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms. 168-181
  
• Hubie Chen, Víctor Dalmau:
  (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. 182-196
  
• Vincent A. Cicirello, Stephen F. Smith:
  Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory. 197-211
  
• David A. Cohen, Martin C. Cooper, Peter Jeavons:
  A Complete Characterization of Complexity for Boolean Constraint Optimization Problems. 212-226
  
• Pierre Flener, Justin Pearson, Luis G. Reyna:
  Financial Portfolio Optimisation. 227-241
  
• Jeremy Frank:
  Bounding the Resource Availability of Partially Ordered Events with Constant Resource Impact. 242-259
  
• Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
  Monotone Literals and Learning in QBF Reasoning. 260-273
  
• Carla P. Gomes, Meinolf Sellmann:
  Streamlined Constraint Reasoning. 274-289
  
• Lars Hellsten, Gilles Pesant, Peter van Beek:
  A Domain Consistency Algorithm for the Stretch Constraint. 290-304
  
• John N. Hooker:
  A Hybrid Method for Planning and Scheduling. 305-316
  
• Kalev Kask, Rina Dechter, Vibhav Gogate:
  Counting-Based Look-Ahead Schemes for Constraint Satisfaction. 317-331
  
• András Kovács, József Váncza:
  Completable Partial Solutions in Constraint Programming and Constraint-Based Scheduling. 332-346
  
• Vitaly Lagoon, Peter J. Stuckey:
  Set Domain Propagation Using ROBDDs. 347-361
  
• Yat Chiu Law, Jimmy Ho-Man Lee:
  Global Constraints for Integer and Set Value Precedence. 362-376
  
• Lucian Leahu, Carla P. Gomes:
  Quality of LP-Based Approximations for Highly Combinatorial Problems. 377-392
  
• Nikos Mamoulis, Kostas Stergiou:
  Constraint Satisfaction in Semi-structured Data Graphs. 393-407
  
• Paul H. Morris, Robert A. Morris, Lina Khatib, Sailesh Ramakrishnan, Andrew Bachmann:
  Strategies for Global Optimization of Temporal Preferences. 408-422
  
• Bertrand Neveu, Gilles Trombettoni, Fred Glover:
  ID Walk: A Candidate List Strategy with a Simple Diversification Device. 423-437
  
• Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoos, Alex Devkar, Yoav Shoham:
  Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. 438-452
  
• Guoqiang Pan, Moshe Y. Vardi:
  Symbolic Decision Procedures for QBF. 453-467
  
• Laurent Perron, Paul Shaw, Vincent Furnon:
  Propagation Guided Large Neighborhood Search. 468-481
  
• Gilles Pesant:
  A Regular Language Membership Constraint for Finite Sequences of Variables. 482-495
  
• Nicola Policella, Angelo Oddi, Stephen F. Smith, Amedeo Cesta:
  Generating Robust Partial Order Schedules. 496-511
  
• Steven David Prestwich:
  Full Dynamic Substitutability by SAT Encoding. 512-526
  
• Jean-Francois Puget:
  Improved Bound Computation in Presence of Several Clique Constraints. 527-541
  
• Claude-Guy Quimper, Alejandro López-Ortiz, Peter van Beek, Alexander Golynski:
  Improved Algorithms for the Global Cardinality Constraint. 542-556
  
• Philippe Refalo:
  Impact-Based Search Strategies for Constraint Programming. 557-571
  
• Jean-Charles Régin, Carla P. Gomes:
  The Cardinality Matrix Constraint. 572-587
  
• Francesca Rossi, Kristen Brent Venable, Neil Yorke-Smith:
  Controllability of Soft Temporal Constraint Problems. 588-603
  
• Andrew Sadler, Carmen Gervet:
  Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries. 604-618
  
• Christian Schulte, Peter J. Stuckey:
  Speeding Up Constraint Propagation. 619-633
  
• Meinolf Sellmann:
  Theoretical Foundations of CP-Based Lagrangian Relaxation. 634-647
  
• Paul Shaw:
  A Constraint for Bin Packing. 648-662
  
• Christian Thiffault, Fahiem Bacchus, Toby Walsh:
  Solving Non-clausal Formulas with DPLL Search. 663-678
  
• Willem Jan van Hoeve:
  A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint. 679-689
  
• Zhao Xing, Weixiong Zhang:
  Efficient Strategies for (Weighted) Maximum Satisfiability. 690-705
  

Short Papers

• Syed Muhammad Ali, Sven Koenig, Milind Tambe:
  Preprocessing Techniques for Distributed Constraint Optimization. 706-710
  
• J. Christopher Beck, Patrick Prosser, Richard J. Wallace:
  Variable Ordering Heuristics Show Promise. 711-715
  
• Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Toby Walsh:
  The Tractability of Global Constraints. 716-720
  
• Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Lakhdar Sais:
  Support Inference for Generic Filtering. 721-725
  
• Wilhelm Cronholm, Farid Ajili:
  Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design. 726-730
  
• Rina Dechter, Robert Mateescu:
  The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. 731-736
  
• Xiaofei Huang:
  A General Extension of Constraint Propagation for Constraint Optimization. 737-741
  
• Haixia Jia, Cristopher Moore:
  How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails. 742-746
  
• Andrew Lim, Brian Rodrigues, Zhou Xu:
  Solving the Crane Scheduling Problem Using Intelligent Search Schemes. 747-751
  
• Nikos Mamoulis, Kostas Stergiou:
  Algorithms for Quantified Constraint Satisfaction Problems. 752-756
  
• Martí Sánchez, Pedro Meseguer, Javier Larrosa:
  Improving the Applicability of Adaptive Consistency: Preliminary Results. 757-761
  
• Martin Sachenbacher, Brian C. Williams:
  On-Demand Bound Computation for Best-First Constraint Optimization. 762-766
  
• Pavel Surynek, Roman Barták:
  A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. 767-771
  
• Marc R. C. van Dongen:
  Computing the Frequency of Partial Orders. 772-776
  
• Yuanlin Zhang:
  On Tightness of Constraints. 777-781
  
• Roie Zivan, Amnon Meisels:
  Concurrent Dynamic Backtracking for Distributed CSPs. 782-787
  

Doctoral Papers

• Magnus Ågren:
  Set Variables and Local Search. 788
  
• Konstantin Artiouchine:
  N-Kings for Dynamic Systems. 789
  
• Sebastian Brand:
  Relation Variables in Qualitative Spatial Reasoning. 790
  
• Ismel Brito:
  Synchronous, Asynchronous and Hybrid Algorithms for DisCSP. 791
  
• Tom Carchrae:
  Long-Term Learning for Algorithm Control. 792
  
• Tien Ba Dinh:
  Solution Extraction with the "Critical Path" in Graphplan-Based Optimal Temporal Planning. 793
  
• Cormac Gebruers, Alessio Guerri:
  Machine Learning for Portfolio Selection Using Structure at the Instance Level. 794
  
• Joel M. Gompert:
  Local Search with Maximal Independent Sets. 795
  
• Venkata Praveen Guddeti:
  A Dynamic Restart Strategy for Randomized BT Search. 796
  
• Tarik Hadzic:
  A BDD-Based Approach to Interactive Configuration. 797
  
• Emmanuel Hebrard:
  Extending Super-solutions. 798
  
• Christopher Jefferson:
  Choosing Efficient Representations of Abstract Variables. 799
  
• Wei Li:
  A Hypergraph Separator Based Variable Ordering Heuristic for Solving Real World SAT. 800
  
• Roland Martin:
  Exploiting Symmetries via Permutations for PC Board Manufacturing. 801
  
• Tomás Müller:
  Iterative Forward Search Algorithm: Combining Local Search with Maintaining Arc Consistency and a Conflict-Based Statistics. 802
  
• María del Pilar Muñoz, Andrés René Hurtado:
  Programming Robotic Devices with a Timed Concurrent Constraint Language. 803
  
• Adrian Petcu:
  Heuristics for the Distributed Breakout Algorithm. 804
  
• Guillaume Rochart:
  Explanations and Numeric CSPs. 805
  
• Kristen Brent Venable:
  Softly Constrained CP Nets. 806
  
• Alfio Vidotto:
  Online Constraint Solving and Rectangle Packing. 807
  
• Christine Wei Wu:
  Modelling Chemical Reactions Using Constraint Programming and Molecular Graphs. 808
  
• Peter Zoeteweij:
  Constraining Special-Purpose Domain Types. 809
  

Demonstrations

• Andrew Bachmann, Tania Bedrax-Weiss, Jeremy Frank, Michael Iatauro, Conor McGann, Will Taylor:
  PLASMA: A Constraint Based Planning Architecture. 810
  
• Owen Bourne, Abdul Sattar:
  Applying Constraint Satisfaction Techniques to 3D Camera Control. 811
  
• Alexander Brodsky, Xiaoyang Sean Wang:
  Adaptive Enterprise Optimization Framework: AEO Server and AEO Studio. 812
  
• Juan Francisco Díaz, Gustavo Gutierrez, Carlos Alberto Olarte, Camilo Rueda:
  CRE2: A CP Application for Reconfiguring a Power Distribution Network for Power Losses Reduction. 813-814
  
• Keith Golden, Wanlin Pang:
  A Constraint-Based Planner Applied to Data Processing Domains. 815
  
• Rune M. Jensen:
  CLab: A C++ Library for Fast Backtrack-Free Interactive Product Configuration.. 816
  
• Ryan Lim, Venkata Praveen Guddeti, Berthe Y. Choueiry:
  A Constraint-Based System for Hiring and Managing Graduate Teaching Assistants. 817
  
• Marius-Calin Silaghi, Vaibhav Rajeshirke, Richard J. Wallace:
  A Web-Based Meeting Scheduling Solver With Privacy Guarantees, Without Trusted Servers. 818
  
• Neng-Fa Zhou:
  A Constraint-Based Graphics Library for B-Prolog. 819-820