default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd CP 1997: Linz, Austria
- Gert Smolka:
Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29 - November 1, 1997, Proceedings. Lecture Notes in Computer Science 1330, Springer 1997
Invited Talk
- Pascal Van Hentenryck:
A Modeling Language for Constraint Programming. 1
Session 1
- Noëlle Bleuzen-Guernalec, Alain Colmerauer:
Narrowing a Block of Sortings in Quadratic Time. 2-16 - Yves Caseau, François Laburthe:
Solving Various Weighted Matching Problems with Constraints. 17-31 - 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 - Ian P. Gent, Judith L. Underwood:
The Logic of Search Algorithms: Theory and Applications. 77-91 - 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 - Irina Rish, Daniel Frost:
Statistical Analysis of Backtracking on Inconsistent CSPs. 150-162
Tutorial
- Yves Caseau:
Using Constraint Propagation for Complex Scheduling Problems: Managing Size, Complex Resources and Travel. 163-166
Session 3
- Daniel Sabin, Eugene C. Freuder:
Understanding and Improving the MAC Algorithm. 167-181 - Barbara M. Smith, Stuart A. Grant:
Modelling Exceptionally Hard Constraint Satisfaction Problems. 182-195
Session 4
- Philippe Galinier, Jin-Kao Hao:
Tabu Search for Maximal Constraint Satisfaction Problems. 196-208 - Youssef Hamadi, David Merceron:
Reconfigurable Architectures: A New Vision for Optimization Problems. 209-221 - Katsutoshi Hirayama, Makoto Yokoo:
Distributed Partial Constraint Satisfaction Problem. 222-236 - Laurent Michel, Pascal Van Hentenryck:
Localizer: A Modeling Language for Local Search. 237-251
Session 5a
- Slim Abdennadher:
Operational Semantics and Confluence of Constraint Propagation Rules. 252-266 - Alexandre Boudet, Evelyne Contejean:
AC-Unification of Higher-Order Patterns. 267-281 - Miki Hermann, Phokion G. Kolaitis:
On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. 282-296 - Martin Müller, Joachim Niehren, Andreas Podelski:
Ordering Constraints over Feature Trees. 297-311
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 - Chu Min Li, Anbulagan:
Look-Ahead Versus Look-Back for Satisfiability Problems. 341-355 - Makoto Yokoo:
Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs. 356-370
Tutorial
- Laurent Michel, Jean-Francois Puget:
Interval Methods for Non-linear Constraints. 371
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 - Stéphane Grumbach, Gabriel M. Kuper:
Tractable Recursion over Geometric Data. 450-462 - Christoph M. Hoffmann, Andrew Lomonosov, Meera Sitharam:
Finding Solvable Subsets of Constraint Graphs. 463-477 - David A. Cohen, Peter Jeavons, Manolis Koubarakis:
Tractable Disjunctive Constraints. 478-490
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
- Leszek Pacholski, Andreas Podelski:
Set Constraints: A Pearl in Research on Constraints. 549-562
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-06 20:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
