Advertisement

Analysis and Visualization Tools for Constraint Programming

Constraint Debugging

  • Pierre Deransart
  • Manuel V. Hermenegildo
  • Jan Małuszynski

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

Table of contents

  1. Front Matter
  2. Debugging of Constraint Programs: The DiSCiPl Methodology and Tools

    1. Pierre Deransart, Manuel V. Hermenegildo, Jan Małuszynski
      Pages 1-20
  3. Part I. Correctness Debugging

    1. Front Matter
      Pages 21-21
    2. Germán Puebla, Francisco Bueno, Manuel Hermenegildo
      Pages 23-61
    3. Germán Puebla, Francisco Bueno, Manuel Hermenegildo
      Pages 63-107
    4. Włodzimierz Drabent, Jan Małuszyński, Paweł Pietrzak
      Pages 121-150
    5. Alexandre Tessier, Gérard Ferrand
      Pages 151-174
  4. Part II. Performance Debugging

    1. Front Matter
      Pages 175-175
    2. Pascal Bouvier
      Pages 177-190
    3. Helmut Simonis, Abder Aggoun
      Pages 191-208
    4. Christophe Aillaud, Pierre Deransart
      Pages 209-236
    5. Manuel Carro, Manuel Hermenegildo
      Pages 237-252
    6. Manuel Carro, Manuel Hermenegildo
      Pages 253-272
    7. Frédéric Goualard, Frédéric Benhamou
      Pages 273-297
    8. Helmut Simonis, Abder Aggoun, Nicolas Beldiceanu, Eric Bourreau
      Pages 299-317
  5. Part III. Test Cases

    1. Front Matter
      Pages 319-319
    2. Helmut Simonis, Trijntje Cornelissens, Véronique Dumortier, Giovanni Fabris, F. Nanni, Adriano Tirabosco
      Pages 321-356
  6. Back Matter

About this book

Introduction

Coordinating production across a supply chain, designing a new VLSI chip, allocating classrooms or scheduling maintenance crews at an airport are just a few examples of complex (combinatorial) problems that can be modeled as a set of decision variables whose values are subject to a set of constraints. The decision variables may be the time when production of a particular lot will start or the plane that a maintenance crew will be working on at a given time. Constraints may range from the number of students you can ?t in a given classroom to the time it takes to transfer a lot from one plant to another.Despiteadvancesincomputingpower,manyformsoftheseandother combinatorial problems have continued to defy conventional programming approaches. Constraint Logic Programming (CLP) ?rst emerged in the mid-eighties as a programming technique with the potential of signi?cantly reducing the time it takes to develop practical solutions to many of these problems, by combining the expressiveness of languages such as Prolog with the compu- tional power of constrained search. While the roots of CLP can be traced to Monash University in Australia, it is without any doubt in Europe that this new software technology has gained the most prominence, bene?ting, among other things, from sustained funding from both industry and public R&D programs over the past dozen years. These investments have already paid o?, resulting in a number of popular commercial solutions as well as the creation of several successful European startups.

Keywords

Constraint Debugging Prolog Scheme constraint debugging constraint programming constraint solving correctness debugging logic performances debugging program analysis program validation programming visualization

Editors and affiliations

  • Pierre Deransart
    • 1
  • Manuel V. Hermenegildo
    • 2
  • Jan Małuszynski
    • 3
  1. 1.Inria-RocquencourtLe Chesnay CedexFrance
  2. 2.School of Computer ScienceTechnical University of MadridMadridSpain
  3. 3.Department of Computer and Information ScienceLinköpings UniversityLinköpingSweden

Bibliographic information

  • DOI https://doi.org/10.1007/10722311
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-41137-6
  • Online ISBN 978-3-540-40016-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site