Principles and Practice of Constraint Programming - CP97: Third International Conference, CP97, Linz, Austria, October 29 - November 1, 1997 | SpringerLink
Skip to main content
Springer Nature Link
Log in

Principles and Practice of Constraint Programming - CP97

Third International Conference, CP97, Linz, Austria, October 29 - November 1, 1997

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Gert Smolka
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1330)

Included in the following conference series:

Conference proceedings info: CP 1997.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book JPY 14299
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the refereed proceedings of the Third International Conference on Principles and Practice of Constraint Programming, CP'97, held in Linz, Austria in October/November 1997.
The volume presents 37 revised full papers carefully selected from a total of 132 submissions; also included are the abstracts of two invited talks and three tutorials. The papers address all current aspects of constraint programming. Among the topics covered are constraint matching, constraint languages, set constraints, constraint search, constraint satisfaction problems, scheduling, constraint routing, temporal constraints, constraint graphs, local search, object-oriented constraint programming, etc.

Keywords

Table of contents (42 papers)

  1. Front Matter

    Download chapter PDF

  2. Visual Solver A modeling language for constraint programming

    • Pascal Van Hentenryck
    Pages 1-1

  3. Narrowing a 2n-block of sortings in O (n logn)

    • Noëlle Bleuzen Guernalec, Alain Colmerauer
    Pages 2-16

  4. Solving various weighted matching problems with constraints

    • Yves Caseau, François Laburthe
    Pages 17-31

  5. A filtering algorithm for global sequencing constraints

    • Jean-Charles Régin, Jean-François Puget
    Pages 32-46

  6. Semantics and expressive power of a timed concurrent constraint language

    • Frank de Boer, M. Gabbrielli, M. C. Meo
    Pages 47-61

  7. Solving classes of set constraints with tree automata

    • P. Devienne, J M. Talbot, S. Tison
    Pages 62-76

  8. The logic of search algorithms: Theory and applications

    • Ian P. Gent, Judith L. Underwood
    Pages 77-91

  9. Verification of parallel systems using constraint programming

    • Stephan Melzer
    Pages 92-106

  10. Random constraint satisfaction: A more accurate picture

    • Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou
    Pages 107-120

  11. Heavy-tailed distributions in combinatorial search

    • Carla P. Gomes, Bart Selman, Nuno Crato
    Pages 121-135

  12. Counting, structure identification and maximum consistency for binary constraint satisfaction problems

    • Gabriel Istrate
    Pages 136-149

  13. Statistical analysis of backtracking on inconsistent CSPs

    • Irina Rish, Daniel Frost
    Pages 150-162

  14. Using constraint propagation for complex scheduling problems: Managing size, complex resources and travel

    • Yves Caseau
    Pages 163-166

  15. Understanding and improving the MAC algorithm

    • Daniel Sabin, Eugene C. Ereuder
    Pages 167-181

  16. Modelling exceptionally hard constraint satisfaction problems

    • Barbara M. Smith, Stuart A. Grant
    Pages 182-195

  17. Tabu search for maximal constraint satisfaction problems

    • Philippe Galinier, Jin-Kao Hao
    Pages 196-208

  18. Reconfigurable architectures: A new vision for optimization problems

    • Y. Hamadi, D. Merceron
    Pages 209-221

  19. Distributed partial constraint satisfaction problem

    • Katsutoshi Hirayama, Makoto Yokoo
    Pages 222-236

  20. Localizer A modeling language for local search

    • Laurent Michel, Pascal Van Hentenryck
    Pages 237-251
Back to top

Other volumes

  1. Principles and Practice of Constraint Programming-CP97

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation