3. CP 1997: Linz, Austria
Gert Smolka (Ed.): Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29 - November 1, 1997, Proceedings. Springer 1997 Lecture Notes in Computer Science
Invited Talk
- Pascal Van Hentenryck: A Modeling Language for Constraint Programming. 1
Session 1
- Jean-Charles Régin, Jean-Francois Puget: A Filtering Algorithm for Global Sequencing Constraints. 32-46
Session 2a
- Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo: Semantics and Expressive Power of a Timed Concurrent Constraint Language. 47-61
- Philippe Devienne, Jean-Marc Talbot, Sophie Tison: Solving Classes of Set Constraints with Tree Automata. 62-76
- Stephan Melzer: Verification of Parallel Systems using Constraint Programming. 92-106
Session 2b
- Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou: Random Constraint Satisfaction: A More Accurate Picture. 107-120
- Carla P. Gomes, Bart Selman, Nuno Crato: Heavy-Tailed Distributions in Combinatorial Search. 121-135
- Gabriel Istrate: Counting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems. 136-149
Tutorial
- Yves Caseau: Using Constraint Propagation for Complex Scheduling Problems: Managing Size, Complex Resources and Travel. 163-166
Session 3
- Barbara M. Smith, Stuart A. Grant: Modelling Exceptionally Hard Constraint Satisfaction Problems. 182-195
Session 4
- Youssef Hamadi, David Merceron: Reconfigurable Architectures: A New Vision for Optimization Problems. 209-221
Session 5a
- Slim Abdennadher: Operational Semantics and Confluence of Constraint Propagation Rules. 252-266
- Miki Hermann, Phokion G. Kolaitis: On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. 282-296
Session 5b
- Romuald Debruyne, Christian Bessière: From Restricted Path Consistency to Max-Restricted Path Consistency. 312-326
- Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh: The Constrainedness of Arc Consistency. 327-340
- Makoto Yokoo: Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs. 356-370
Tutorial
Invited Talk
- Steven Minton: Configurable Solvers: Tailoring General Methods to Specific Applications. 372-374
Session 6
- Philippe Baptiste, Claude Le Pape: Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. 375-389
- J. Christopher Beck, Andrew J. Davenport, Mark S. Fox: Five Pitfalls of Empirical Scheduling Research. 390-404
- Simon de Givry, Gérard Verfaillie, Thomas Schiex: Bounding the Optimum of Constraint Optimization Problems. 405-419
- Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau: GENIUS-CP: a Generic Single-Vehicle Routing Algorithm. 420-434
Session 7a
- Claudio Bettini, Xiaoyang Sean Wang, Sushil Jajodia: Satisfiability of Quantitative Temporal Constraints with Multiple Granularities. 435-449
- Christoph M. Hoffmann, Andrew Lomonosov, Meera Sitharam: Finding Solvable Subsets of Constraint Graphs. 463-477
Session 7b
- Warwick Harvey, Peter J. Stuckey, Alan Borning: Compiling Constraint Solving using Projection. 491-505
- Jean-Marc Labat, Laurent Mynard: Oscillation, Heuristic Ordering and Pruning in Neighborhood Search. 506-518
- Christian Schulte: Programming Constraint Inference Engines. 519-533
- Igor Shvetsov, Vitaly Telerman, Dmitry Ushakov: NeMo+: Object-Oriented Constraint Programming Environment Based on Subdefinite Models. 534-548
Tutorial
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team