Abstract Domains in Constraint Programming

Abstract Domains in Constraint Programming

1st Edition - May 6, 2015

Write a review

  • Author: Marie Pelleau
  • eBook ISBN: 9780081004647

Purchase options

Purchase options
DRM-free (PDF, Mobi, EPub)
Sales tax will be calculated at check-out

Institutional Subscription

Free Global Shipping
No minimum order


Constraint Programming aims at solving hard combinatorial problems, with a computation time increasing in practice exponentially. The methods are today efficient enough to solve large industrial problems, in a generic framework. However, solvers are dedicated to a single variable type: integer or real. Solving mixed problems relies on ad hoc transformations. In another field, Abstract Interpretation offers tools to prove program properties, by studying an abstraction of their concrete semantics, that is, the set of possible values of the variables during an execution. Various representations for these abstractions have been proposed. They are called abstract domains. Abstract domains can mix any type of variables, and even represent relations between the variables. In this work, we define abstract domains for Constraint Programming, so as to build a generic solving method, dealing with both integer and real variables. We also study the octagons abstract domain, already defined in Abstract Interpretation. Guiding the search by the octagonal relations, we obtain good results on a continuous benchmark. We also define our solving method using Abstract Interpretation techniques, in order to include existing abstract domains. Our solver, AbSolute, is able to solve mixed problems and use relational domains.

Key Features

  • Exploits the over-approximation methods to integrate AI tools in the methods of CP
  • Exploits the relationships captured to solve continuous problems more effectively
  • Learn from the developers of a solver capable of handling practically all abstract domains


Researchers and graduate students in Constraint Programming, Researchers in Artificial Intelligence, Operations Research, and Mathematical Programming

Table of Contents

    • Dedication
    • Preface
    • Introduction
      • I.1 Context
      • I.2 Problematic
      • I.3 Outline of the book
      • I.4 Contributions
    • 1. State of the Art
      • Abstract
      • 1.1 Abstract interpretation
      • 1.2 Constraint programming
      • 1.3 Synthesis
    • 2. Abstract Interpretation for the Constraints
      • Abstract
      • 2.1 Introduction
      • 2.2 Unified components
      • 2.3 Unified solving
      • 2.4 Conclusion
    • 3. Octagons
      • Abstract
      • 3.1 Definitions
      • 3.2 Representations
      • 3.3 Abstract domain components
      • 3.4 Abstract domains
      • 3.5 Conclusion
    • 4. Octagonal Solving
      • Abstract
      • 4.1 Octagonal CSP
      • 4.2 Octagonal consistency and propagation
      • 4.3 Octagonal solver
      • 4.4 Experimental results
      • 4.5 Conclusion
    • 5. An Abstract Solver: AbSolute
      • Abstract
      • 5.1 Abstract solving method
      • 5.2 The AbSolute solver
      • 5.3 Conclusion
    • Conclusion and Perspectives
      • C.1 Conclusion
      • C.2 Perspectives
    • Bibliography
    • Index

Product details

  • No. of pages: 176
  • Language: English
  • Copyright: © ISTE Press - Elsevier 2015
  • Published: May 6, 2015
  • Imprint: ISTE Press - Elsevier
  • eBook ISBN: 9780081004647

About the Author

Marie Pelleau

Marie Pelleau is a Doctorate in Computer Science at the University of Nantes, France. Her research interests include Constraint Programming and local research Constraint Programming (CP) to model and solve combinatory problems.

Affiliations and Expertise

Université de Nantes, France

Ratings and Reviews

Write a review

There are currently no reviews for "Abstract Domains in Constraint Programming"