Constraint Programming: Basics and Trends: 1994 Chatillon Spring School, Chatillon-sur-Seine, France, May 16 - 20, 1994. Selected Papers | SpringerLink
Skip to main content
Springer Nature Link
Log in

Constraint Programming: Basics and Trends

1994 Chatillon Spring School, Chatillon-sur-Seine, France, May 16 - 20, 1994. Selected Papers

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Andreas Podelski
    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 910)

Included in the following conference series:

Conference proceedings info: TCS School 1994.

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 7149
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 contains thoroughly revised versions of the papers presented at the 1994 Châtillon Spring School held in May 1994. This spring school was the 22nd event in a series of advanced seminars presenting important new areas of research to the theoretical computer science community.
The interdisciplinary area of constraint (logic) programming and constraint-based systems has recently developed a discernible identity, which is promising both in terms of simple and general foundations and in terms of significant practical applications. The 15 papers presented in this volume make the new area accessible to all interested computer scientists and report the state of the art in this exciting new field, particularly in the subfield of constraint logic programming.

Similar content being viewed by others

Keywords

Table of contents (15 papers)

  1. Front Matter

    Download chapter PDF

  2. Interval constraint logic programming

    • Frédéric Benhamou
    Pages 1-21

  3. Solving pseudo-Boolean constraints

    • Alexander Bockmayr
    Pages 22-38

  4. Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods

    • Philippe Codognet, Giuseppe Nardiello
    Pages 39-61

  5. Constraints in term algebras an overview of constraint solving techniques

    • Hubert Comon
    Pages 62-67

  6. Constructive negation by pruning and optimization higher-order predicates for CLP and CC languages

    • François Fages
    Pages 68-89

  7. Constraint handling rules

    • Thom Frühwirth
    Pages 90-107

  8. Linear constraint solving in CLP-Languages

    • Jean -Louis J. Imbert
    Pages 108-127

  9. On the use of constraints in automated deduction

    • Hélène Kirchner
    Pages 128-146

  10. Abstract interpretation and finite domain symbolic constraints

    • Baudouin Le Charlier
    Pages 147-170

  11. Concurrency and Concurrent Constraint Programming

    • Ugo Montanari, Francesca Rossi
    Pages 171-192

  12. Toupie: A constraint language for model checking

    • Antoine Rauzy
    Pages 193-208

  13. Imagining CLP(Λ,≡αβ)

    • Olivier Ridoux
    Pages 209-230

  14. An architecture for cooperating constraint solvers on reals

    • Michel Rueher
    Pages 231-250

  15. The definition of Kernel Oz

    • Gert Smolka
    Pages 251-292

  16. Design, implementation, and evaluation of the constraint language cc(FD)

    • Pascal Van Hentenryck, Vijay Saraswat, Yves Deville
    Pages 293-316

  17. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Constraint Programming: Basics and Trends

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation