11. CP 2005:
Sitges (Barcelona), Spain
Peter van Beek (Ed.):
Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings.
Lecture Notes in Computer Science 3709 Springer 2005, ISBN 3-540-29238-1 
Invited Papers
Best Papers
Full Papers
- Magnus Ågren, Pierre Flener, Justin Pearson:
Incremental Algorithms for Local Search from Existential Second-Order Logic.
47-61
- Konstantin Artiouchine, Philippe Baptiste:
Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs.
62-76
- Heikel Batnini, Claude Michel, Michel Rueher:
Mind the Gaps: A New Splitting Strategy for Consistency Techniques.
77-91
- Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Rampon, Charlotte Truchet:
Graph Invariants as Necessary Conditions for Global Constraints.
92-106
- Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano:
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation.
107-121
- Russell Bent, Irit Katriel, Pascal Van Hentenryck:
Sub-optimality Approximations.
122-136
- Hariolf Betz, Thom W. Frühwirth:
A Linear-Logic Semantics for Constraint Handling Rules.
137-151
- Ismel Brito, Pedro Meseguer:
Distributed Stable Matching Problems.
152-166
- Hubie Chen, Víctor Dalmau:
Beyond Hypertree Width: Decomposition Methods Without Decompositions.
167-181
- Kenil C. K. Cheng, Roland H. C. Yap:
Ad-hoc Global Constraints for Life.
182-195
- Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien:
Tractable Clones of Polynomials over Semigroups.
196-210
- Grégoire Dooms, Yves Deville, Pierre Dupont:
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming.
211-225
- Jérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier:
Interval Analysis in Scheduling.
226-240
- Felix Geller, Michael Veksler:
Assumption-Based Pruning in Conditional CSP.
241-255
- Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDonald, Ian Miguel, Barbara M. Smith:
Conditional Symmetry Breaking.
256-270
- Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Roney-Dougal:
Symmetry and Consistency.
271-285
- Warwick Harvey, Thorsten Winterer:
Solving the MOLR and Social Golfers Problems.
286-300
- Laurent Henocque, Mathias Kleiner, Nicolas Prcovic:
Advances in Polytime Isomorph Elimination for Configuration.
301-313
- John N. Hooker:
Planning and Scheduling to Minimize Tardiness.
314-327
- Tudor Hulubei, Barry O'Sullivan:
Search Heuristics and Heavy-Tailed Behaviour.
328-342
- Joey Hwang, David G. Mitchell:
2-Way vs. d-Way Branching for CSP.
343-357
- Irit Katriel, Pascal Van Hentenryck:
Maintaining Longest Paths in Cyclic Graphs.
358-372
- Ludwig Krippahl, Pedro Barahona:
Applying Constraint Programming to Rigid Body Protein Docking.
373-387
- Andrei A. Krokhin, Benoit Larose:
Maximum Constraint Satisfaction on Diamonds.
388-402
- Chu Min Li, Felip Manyà, Jordi Planes:
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.
403-414
- Hui Li, Brian Williams:
Generalized Conflict Learning for Hybrid Discrete/Linear Optimization.
415-429
- Laurent Michel, Pascal Van Hentenryck:
Parallel Local Search in Comet.
430-444
- Barry O'Callaghan, Barry O'Sullivan, Eugene C. Freuder:
Generating Corrective Explanations for Interactive Constraint Satisfaction.
445-459
- Gilles Pesant, Jean-Charles Régin:
SPREAD: A Balancing Constraint Based on Statistics.
460-474
- Jean-Francois Puget:
Automatic Detection of Variable and Value Symmetries.
475-489
- Jean-Francois Puget:
Breaking All Value Symmetries in Surjection Problems.
490-504
- Jean-Charles Régin:
AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm.
505-519
- Jean-Charles Régin:
Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost.
520-533
- Jochen Renz, Gérard Ligozat:
Weak Composition for Qualitative Spatial and Temporal Reasoning.
534-548
- Georg Ringwelski, Youssef Hamadi:
Boosting Distributed Constraint Satisfaction.
549-562
- Emma Rollon, Javier Larrosa:
Depth-First Mini-Bucket Elimination.
563-577
- Horst Samulowitz, Fahiem Bacchus:
Using SAT in QBF.
578-592
- Martí Sánchez, Javier Larrosa, Pedro Meseguer:
Tree Decomposition with Function Filtering.
593-606
- Hossein M. Sheini, Bart Peintner, Karem A. Sakallah, Martha E. Pollack:
On Solving Soft Temporal Constraints Using SAT Techniques.
607-621
- Kish Shen, Joachim Schimpf:
Eplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming.
622-636
- Barbara M. Smith:
Caching Search States in Permutation Problems.
637-651
- Kostas Stergiou:
Repair-Based Methods for Quantified CSPs.
652-666
- Michael Thielscher:
Handling Implication and Universal Quantification Constraints in FLUX.
667-681
- Vincent Vidal, Hector Geffner:
Solving Simple Planning Problems with More Inference and No Search.
682-696
- Benjamin W. Wah, Yixin Chen:
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning.
697-711
- Richard Wallace:
Factor Analytic Studies of CSP Heuristics.
712-726
Short Papers
- Anbulagan, John K. Slaney:
Lookahead Saturation with Restriction for SAT.
727-731
- Stuart Bain, John Thornton, Abdul Sattar:
Evolving Variable-Ordering Heuristics for Constrained Optimisation.
732-736
- J. Christopher Beck:
Multi-point Constructive Search.
737-741
- Nicolas Beldiceanu, Thierry Petit, Guillaume Rochart:
Bounds of Graph Characteristics.
742-746
- Christian Bessière, Remi Coletta, Thierry Petit:
Acquiring Parameters of Implied Global Constraints.
747-751
- Hadrien Cambazard, Narendra Jussien:
Integrating Benders Decomposition Within Constraint Programming.
752-756
- Sylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Sais:
Using Boolean Constraint Propagation for Sub-clauses Deduction.
757-761
- Bistra N. Dilkina, Lei Duan, William S. Havens:
Extending Systematic Local Search for Job Shop Scheduling Problems.
762-766
- Tarik Hadzic, Henrik Reif Andersen:
Interactive Reconfiguration in Power Supply Restoration.
767-771
- Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, Duc Nghia Pham:
Neighbourhood Clause Weight Redistribution in Local Search for SAT.
772-776
- Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks.
777-781
- Alexander Lazovik, Marco Aiello, Rosella Gennari:
Encoding Requests to Web Service Compositions as Constraints.
782-786
- Mistuo Motoki:
Test Instance Generation for MAX 2SAT.
787-791
- Peter Nightingale:
Consistency for Quantified Constraint Satisfaction Problems.
792-796
- Laurent Perron:
Alternate Modeling in Sport Scheduling.
797-801
- Adrian Petcu, Boi Faltings:
Approximations in Distributed Optimization.
802-806
- Nicolas Prcovic:
Extremal CSPs.
807-811
- Claude-Guy Quimper, Toby Walsh:
Beyond Finite Domains: The All Different and Global Cardinality Constraints.
812-816
- Christian Schulte, Guido Tack:
Views and Iterators for Generic Constraint Implementations.
817-821
- Meinolf Sellmann:
Approximated Consistency for the Automatic Recording Problem.
822-826
- Carsten Sinz:
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints.
827-831
- Stéphane Zampelli, Yves Deville, Pierre Dupont:
Approximate Constrained Subgraph Matching.
832-836
Doctoral Papers
- Montserrat Abril, Miguel A. Salido, Federico Barber:
Distributed Constraints for Large-Scale Scheduling Problems.
837
- Josep Argelich, Felip Manyà:
Solving Over-Constrained Problems with SAT.
838
- David A. Burke, Kenneth N. Brown:
A Constraint Based Agent for TAC-SCM.
839
- Mihaela Butaru, Zineb Habbas:
Solving the Car-Sequencing Problem as a Non-binary CSP.
840
- Cyril Canon, Jean-Charles Billaut, Jean-Louis Bouquard:
Dimensioning an Inbound Call Center Using Constraint Programming.
841
- Tom Carchrae, J. Christopher Beck, Eugene C. Freuder:
Methods to Learn Abstract Scheduling Models.
842
- Pavel Cejnar, Roman Barták:
Automated Search for Heuristic Functions.
843
- Le Chang, Alan K. Mackworth:
Constraint-Based Inference: A Bridge Between Constraint Processing and Probability Inference.
844
- Iván Dotú, Alvaro del Val, Pascal Van Hentenryck:
Scheduling Social Tournaments.
845
- Latife Genç Kaya, John N. Hooker:
Domain Reduction for the Circuit Constraint.
846
- Carlos Grandón, Bertrand Neveu:
Using Constraint Programming for Solving Distance CSP with Uncertainty.
847
- Emmanuel Hebrard, Toby Walsh:
Improved Algorithm for Finding (a, b)-Super Solutions.
848
- Federico Heras, Javier Larrosa:
Local Consistency in Weighted CSPs and Inference in Max-SAT.
849
- Matthias Hoche, Stefan Jähnichen:
Modeling Constraint Programs with Software Technology Standards.
850
- Chris Houghton, David A. Cohen:
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems.
851
- Eric I. Hsu, Sheila A. McIlraith:
Mechanism Design for Preference Aggregation over Coalitions.
852
- Lucian Leahu, Carla P. Gomes:
LP as a Global Search Heuristic Across Different Constrainedness Regions.
853
- Andrei Legtchenko, Arnaud Lallouet:
Consistency for Partially Defined Constraints.
854
- Cheuk Fun Bede Leung, Barry Richards, Olli Kamarainen:
Subnet Generation Problem: A New Network Routing Problem.
855
- Tiziana Ligorio, Susan L. Epstein:
Partial Redundant Modeling.
856
- Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems.
857
- Roland Martin, Karsten Weihe:
Weak Symmetries in Problem Formulations.
858
- Bernadette Martínez Hernández, Alan M. Frisch:
Towards the Systematic Generation of Channelling Constraints.
859
- Robert Mateescu, Rina Dechter:
AND/OR Search Spaces and the Semantic Width of Constraint Networks.
860
- Ramón Béjar, Cèsar Fernández, Carles Mateu:
Statistical Modelling of CSP Solving Algorithms Performance.
861
- Deepak Mehta, Marc R. C. van Dongen:
Probabilistic Arc Consistency.
862
- Henry Müller, Stefan Jähnichen:
GOOSE - A Generic Object-Oriented Search Environment.
863
- Quang Nguyen, Boi Faltings:
Randomization for Multi-agent Constraint Optimization.
864
- Maria Silvia Pini, Francesca Rossi:
Uncertainty in Soft Constraint Problems.
865
- Luis Quesada, Peter Van Roy, Yves Deville:
Speeding Up Constrained Path Solvers with a Reachability Propagator.
866
- Claude-Guy Quimper, Alejandro López-Ortiz:
From Linear Relaxations to Global Constraint Propagation.
867
- Pavel Surynek, Roman Barták:
Encoding HTN Planning as a Dynamic CSP.
868
- Chris Unsworth, Patrick Prosser:
Specialised Constraints for Stable Matching Problems.
869
- Stefania Verachi, Steven David Prestwich:
Bounds-Consistent Local Search.
870
- Alfio Vidotto, Kenneth N. Brown, J. Christopher Beck:
Robust Constraint Solving Using Multiple Heuristics.
871
- Christine Wei Wu, Kenneth N. Brown, J. Christopher Beck:
Scheduling with Uncertain Start Dates.
872
- Honglei Zeng, Sheila A. McIlraith:
The Role of Redundant Clauses in Solving Satisfiability Problems.
873
- Yaling Zheng, Berthe Y. Choueiry:
Applying Decomposition Methods to Crossword Puzzle Problems.
874
- Roie Zivan, Amnon Meisels:
Asymmetric Distributed Constraints Satisfaction Problems.
875
- Josef Zlomek, Roman Barták:
Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains.
876
System Demonstrations
- Alexander Brodsky, Hadon Nash:
CoJava: A Unified Language for Simulation and Optimization.
877-877
- Antonio J. Fernández, Maria Teresa Hortalá-González, Fernando Sáenz-Pérez:
Programming with TOY(FD).
878-878
- Emmanuel Hebrard, Paul Tyler, Toby Walsh:
Computing Super-Schedules.
879-879
- András Kovács, Péter Egri, Tamás Kis, József Váncza:
Proterv-II: An Integrated Production Planning and Scheduling System.
880-880
- Laurent Michel, Pascal Van Hentenryck:
The Comet Programming Language and System.
881-881
- Yehuda Naveh, Roy Emek:
Random Stimuli Generation for Functional Hardware Verification as a CP Application.
882-882
- Erik Meer:
A BDD-Based Interactive Configurator for Modular Systems.
883-883
Last update Sun May 19 21:55:52 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
